User menu

Accès à distance ? S'identifier sur le proxy UCLouvain | Saint-Louis

Search

Displaying 1 - 25 of 201 results.

Pages

    • BookChapter
    LS-LIB: A Library of tools for Solving Production Planning Problems
    Pochet, Yves[UCL] Van Vyve, Mathieu Wolsey, Laurence[UCL] (2009) Research Trends in Combinatorial Optimization — [ISBN : 978-3-540-76795-4]
    • Journal article
    Facets and strong valid inequalities for integer programs
    Wolsey, Laurence[UCL] (1976) Operational Research — Vol. 24, p. 367-372 (1976)
    • Journal article
    Best Algorithms for Approximating the Maximum of a Submodular Set Function
    Nemhauser, G.L. Wolsey, Laurence[UCL] (1978) Mathematics of operations research — Vol. 3, p. 177-188 (1978)
    • WorkingPaper
    Lot-sizing on a tree
    • Journal article
    An analysis of approximations for finding a maximum weight Hamiltonian circuit
    Fisher, M.L. Nemhauser, G.L. Wolsey, Laurence[UCL] (1979) Operations research — Vol. 27, p. 799-809 (1979)
    • Journal article
    Valid inequalities and separation for uncapacitated fixed charge networks
    Vanroy, TJ. Wolsey, Laurence[UCL] (1985) Operations Research Letters — Vol. 4, no. 3, p. 105-112 (1985)
    • Journal article
    The mixing Set with flows
    Wolsey, Laurence[UCL] Conforti, Michèle Di Summa, Marco (2008) Journal on Discrete Mathematics — Vol. 29, no. 2, p. 396-407 (2008)
    • Journal article
    Non-Standard Approaches to Integer Programming
    Aardal, Karen Weismantel, Robert Wolsey, Laurence[UCL] (2002) Discrete Applied Mathematics — Vol. 123, no. 1, p. 5-74 (Novembre 2002)
    • Journal article
    Packing and Covering a Tree By Subtrees
    Barany, I. Edmonds, J. Wolsey, Laurence[UCL] (1986) Combinatorica — Vol. 6, no. 3, p. 221-233 (1986)
    • Journal article
    An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem
    Wolsey, Laurence[UCL] (1982) Combinatorica — Vol. 2, no. 4, p. 385-393 (1982)

Pages