Search

Pages

1. • Journal article

   • 

   Formulations for multi-item discrete lot-sizing problems

   Miller, Andrew Wolsey, Laurence[UCL] (2003) Operations Research — Vol. 51, no. 4, p. 557-565 (Juillet 2003)
2. • Journal article

   • 

   Cutting Planes in Integer and Mixed Integer Programming

   Marchand, Hugues Martin, Alexander Weismantel, Robert Wolsey, Laurence[UCL] (2002) Discrete Applied Mathematics — Vol. 123, no. 1, p. 397-446 (Novembre 2002)
3. • 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)
4. • Journal article

   • 

   On the Wagner-Whitin Lot-Sizing Polyhedron

   Pereira, Olivier[UCL] Wolsey, Laurence[UCL] (2001) Mathematics of Operations Research — Vol. 26, no. 3, p. 591-600 (Août 2001)
5. • Journal article

   • 

   Traces of the XII Aussois Workshop on Combinatorial Optimization PREFACE

   Juenger, Michael Wolsey, Laurence[UCL] Liebling, Thomas M. Naddef, Denis Pulleyblank, William R. Reinelt, Gerhard Rinaldi, Giovanni (2010) Mathematical Programming — Vol. 124, no. 1-2, p. 1-6 (2010)
6. • Journal article

   • 

   Two “Well-Known” Properties of Subgradient Optimization

   Wolsey, Laurence[UCL] Anstreicher, Kurt (2006) Mathematical Programming Journal — Vol. 120, no. 1, p. 213-220 (2009)
7. • Journal article

   • 

   The 0-1 Knapsack problem with a single continuous variable

   Marchand, H Wolsey, Laurence[UCL] (1999) Mathematical Programming — Vol. 85, no. 1, p. 15-33 (1999)
8. • Journal article

   • 

   A Time Indexed Formulation of Nonpreemptive Single-machine Scheduling Problems

   Sousa, JP. Wolsey, Laurence[UCL] (1992) Mathematical Programming — Vol. 54, no. 3, p. 353-367 (1992)
9. • Journal article

   • 

   The uncapacitated lot-sizing problem with sales and safety stocks

   Loparic, Marko[UCL] Wolsey, Laurence[UCL] Pochet, Yves[UCL] (2001) Mathematical Programming A — Vol. 89, no. 3, p. 487-504 (2001)
10. • Journal article

    • 

    Valid Inequalities for the Lasdon-terjung Production-model

    Vanderbeck, F. Wolsey, Laurence[UCL] (1992) The journal of the Operational Research Society — Vol. 43, no. 5, p. 435-441 (1992)
11. • 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)
12. • Journal article

    • 

    On the cut polyhedron

    Wolsey, Laurence[UCL] Conforti, Michèle Rinaldi, Giovanni (2008) Discrete Mathematics — Vol. 277, no. 1-3, p. 279-285 (2008)
13. • Journal article

    • 

    Tight MIP Formulations for Multi-Item Discrete Lot-Sizing Problems

    Wolsey, Laurence[UCL] Miller, Andrew J. (2003) Operations Research — Vol. 51, no. 4, p. 557-565 (Août 2003)
14. • Journal article

    • 

    Valid inequalities and superadditivity for 0-1 integer programs

    Wolsey, Laurence[UCL] (1977) Mathematics of operations research — Vol. 2, p. 66-77 (1977)
15. • Journal article

    • 

    A Recursive Procedure To Generate All Cuts for 0-1 Mixed Integer Programs

    Nemhauser, GL. Wolsey, Laurence[UCL] (1990) Mathematical Programming — Vol. 46, no. 3, p. 379-390 (1990)
16. • Journal article

    • 

    Multi-item lot-sizing with joint set-up costs

    Anily, Soshana Tzur, Michal Wolsey, Laurence[UCL] (2009) Mathematical Programming — Vol. 119, no. 1, p. 79-94 (2009)
17. • Journal article

    • 

    Strong Formulations for Mixed Integer Programming - a Survey

    Wolsey, Laurence[UCL] (1989) Mathematical Programming — Vol. 45, no. 1, p. 173-191 (1989)
18. • Journal article

    • 

    Lot-sizing With Constant Batches - Formulation and Valid Inequalities

    Pochet, Yves[UCL] Wolsey, Laurence[UCL] (1993) Mathematics of Operations Research — Vol. 18, no. 4, p. 767-785 (1993)
19. • 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)
20. • Journal article

    • 

    Combining Problem Structure with Basis Reduction to solve a Class of Hard Integer Programs

    Louveaux, Quentin Wolsey, Laurence[UCL] (2002) Mathematics of Operations Research — Vol. 27, no. 3, p. 470-484 (Août 2002)
21. • Journal article

    • 

    Lot-size Models With Backlogging - Strong Reformulations and Cutting Planes

    Pochet, Yves[UCL] Wolsey, Laurence[UCL] (1988) Mathematical Programming — Vol. 40, no. 3, p. 317-335 (1988)
22. • Journal article

    • 

    Solving Mixed Integer Programming-problems Using Automatic Reformulation

    Van Roy, T.J. Wolsey, Laurence[UCL] (1987) Operations Research — Vol. 35, no. 1, p. 45-57 (1987)
23. • 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)
24. • 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)
25. • Journal article

    • 

    Valid Inequalities and Projecting the Multicommodity Extended Formulation for Incapacitated Fixed Charge Network Flow Problems

    Rardin, RL. Wolsey, Laurence[UCL] (1993) European Journal of Operational Research — Vol. 71, no. 1, p. 95-109 (1993)

Pages