User menu

Search

Displaying 1 - 25 of 63 results.

Pages

    • 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
    Lot-sizing Polyhedra With a Cardinality Constraint
    Aghezzaf, El-Houssaine Wolsey, Laurence[UCL] (1992) Operations Research Letters — Vol. 11, no. 1, p. 13-18 (1992)
    • Journal article
    Integer Programming Duality - Price Functions and Sensitivity Analysis
    Wolsey, Laurence[UCL] (1981) Mathematical Programming — Vol. 20, no. 2, p. 173-195 (1981)
    • 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)
    • Journal article
    The nucleolus and kernel for simple games, or special valid inequalities for 0-1 linear integer programs
    Wolsey, Laurence[UCL] (1977) International Journal of Game Theory — Vol. 5, p. 227-238 (1977)
    • Journal article
    MIP modelling of changeovers in production planning and scheduling problems
    Wolsey, Laurence[UCL] (1997) European Journal of Operational Research — Vol. 99, no. 1, p. 154-165 (1997)
    • Journal article
    Coefficient reduction for inequalities in 0-1 variables
    Bradley, Gordon H. Hammer, Peter L. Wolsey, Laurence[UCL] (1974) Mathematical Programming — Vol. 7, p. 263-282 (1974)
    • Journal article
    Polyhedra for Lot-sizing With Wagner-whitin Costs
    Pochet, Yves[UCL] Wolsey, Laurence[UCL] (1994) Mathematical Programming — Vol. 67, no. 3, p. 297-323 (1994)
    • Journal article
    Sensitivity Analysis for Branch and Bound Integer Programming
    Schrage, L. Wolsey, Laurence[UCL] (1985) Operations Research — Vol. 33, no. 5, p. 1008-1023 (1985)
    • Journal article
    The node capacitated graph partitioning problem: a computational study
    Ferreira, Carlos Martin, Alexander De Souza, Cid[UCL] Weismantel, Robert[UCL] Wolsey, Laurence[UCL] (1998) Mathematical Programming — Vol. 81, no. 2, p. 229-256 (1998)
    • Journal article
    Uncapacitated Lot-sizing Problems With Start-up Costs
    Wolsey, Laurence[UCL] (1989) Operations Research — Vol. 37, no. 5, p. 741-747 (1989)
    • Journal article
    Submodularity and Valid Inequalities in Capacitated Fixed Charge Networks
    Wolsey, Laurence[UCL] (1989) Operations Research Letters — Vol. 8, no. 3, p. 119-124 (1989)
    • Journal article
    Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
    Wolsey, Laurence[UCL] (2002) Management Science — Vol. 48, no. 12, p. 1587-1602 (Décembre 2002)
    • Journal article
    Modeling Piecewise-linear Concave Costs in a Tree Partitioning Problem
    Aghezzaf, El-Houssaine Wolsey, Laurence[UCL] (1994) Discrete Applied Mathematics — Vol. 50, no. 2, p. 101-109 (1994)
    • Journal article
    bc-prod: A specialized branch-and-cut system for lot-sizing problems
    Belvaux, Gaetan[UCL] Wolsey, Laurence[UCL] (2000) Management Science — Vol. 46, no. 5, p. 724-738 (2000)
    • Journal article
    Composite lifting of group inequalities and an application to two-row mixing inequalities
    Dey, Santanu S. Wolsey, Laurence[UCL] (2010) Discrete Optimization — Vol. 7, no. 4, p. 256-268 (2010)
    • Journal article
    Integer Knapsack and Flow Covers With Divisible Coefficients - Polyhedra, Optimization and Separation
    Pochet, Yves[UCL] Wolsey, Laurence[UCL] (1995) Discrete Applied Mathematics — Vol. 59, no. 1, p. 57-74 (1995)
    • Journal article
    Optimal placement of add/drop multiplexers: Static and dynamic models
    Belvaux, Gaetan[UCL] Boissin, N Sutter, A Wolsey, Laurence[UCL] (1998) European Journal of Operational Research — Vol. 108, no. 1, p. 26-35 (1998)
    • Journal article
    Modelling Practical Lot-Sizing Problems as Mixed Integer Programs
    Belvaux, Gaetan[UCL] Wolsey, Laurence[UCL] (2001) Management Science — Vol. 47, no. 7, p. 993-1007 (Juillet 2001)
    • Journal article
    Valid Linear Inequalities for Fixed Charge Problems
    Padberg, M.W. Van Roy, T.J. Wolsey, Laurence[UCL] (1985) Operations Research — Vol. 33, no. 4, p. 842-861 (1985)
    • Journal article
    Further facet generating procedures for vertex packing polytopes
    Wolsey, Laurence[UCL] (1976) Mathematical Programming — Vol. 11, p. 158-163 (1976)
    • Journal article
    Aggregation and Mixed Integer Rounding to solve MIPs
    Marchan, Hugues Wolsey, Laurence[UCL] (2001) Operations Research — Vol. 49, no. 3, p. 363-371 (Mai 2001)
    • Journal article
    Worst-case and Probabilistic Analysis of Algorithms for a Location Problem
    Cornuejols, G. Nemhauser, GL. Wolsey, Laurence[UCL] (1980) Operations Research — Vol. 28, no. 4, p. 847-858 (1980)
    • Journal article
    On the Use of Penumbras in Blocking and Anti-blocking Theory
    Tind, J. Wolsey, Laurence[UCL] (1982) Mathematical Programming — Vol. 22, no. 1, p. 71-81 (1982)
    • Journal article
    Covering linear programming with violations
    Qiu, Feng Ahmed, Shabbir Dey, Santanu S. Wolsey, Laurence[UCL] (2013) INFORMS Journal on Computing — Vol. 26, no.3, p. 531-546 (2014)

Pages