Laurence A. Wolsey

Rafael A. Melo, Laurence A. Wolsey: MIP formulations and heuristics for two-level production-transportation problems. Computers & OR 39(11): 2776-2786 (2012)

Céline Gicquel, Laurence A. Wolsey, Michel Minoux: On discrete lot-sizing and scheduling on identical parallel machines. Optimization Letters 6(3): 545-557 (2012)

Marco Di Summa, Laurence A. Wolsey: Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discrete Math. 25(2): 731-732 (2011)

Marco Di Summa, Laurence A. Wolsey: Mixing Sets Linked by Bidirected Paths. SIAM Journal on Optimization 21(4): 1594-1613 (2011)

Nadjib Brahimi, Stéphane Dauzère-Pérès, Laurence A. Wolsey: Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times. Computers & OR 37(1): 182-188 (2010)

Santanu S. Dey, Laurence A. Wolsey: Composite lifting of group inequalities and an application to two-row mixing inequalities. Discrete Optimization 7(4): 256-268 (2010)

Rafael A. Melo, Laurence A. Wolsey: Optimizing production and transportation in a commit-to-delivery business mode. European Journal of Operational Research 203(3): 614-618 (2010)

Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli: Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35(3): 603-623 (2010)

Yves Pochet, Laurence A. Wolsey: Single item lot-sizing with non-decreasing capacities. Math. Program. 121(1): 123-143 (2010)

Karen Aardal, Laurence A. Wolsey: Lattice based extended formulations for integer linear equality systems. Math. Program. 121(2): 337-352 (2010)

Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey: Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010)

Santanu S. Dey, Laurence A. Wolsey: Two row mixed-integer cuts via lifting. Math. Program. 124(1-2): 143-174 (2010)

Rafael A. Melo, Laurence A. Wolsey: Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38(4): 241-245 (2010)

Marco Di Summa, Laurence A. Wolsey: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discrete Math. 24(3): 853-875 (2010)

Santanu S. Dey, Laurence A. Wolsey: Constrained Infinite Group Relaxations of MIPs. SIAM Journal on Optimization 20(6): 2890-2912 (2010)

Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey: Experiments with Two Row Tableau Cuts. IPCO 2010: 424-437

Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey: Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009)

Shoshana Anily, Michal Tzur, Laurence A. Wolsey: Multi-item lot-sizing with joint set-up costs. Math. Program. 119(1): 79-94 (2009)

Kurt M. Anstreicher, Laurence A. Wolsey: Two "well-known" properties of subgradient optimization. Math. Program. 120(1): 213-220 (2009)

Michele Conforti, Laurence A. Wolsey: Compact formulations as a union of polyhedra. Math. Program. 114(2): 277-289 (2008)

Marco Di Summa, Laurence A. Wolsey: Lot-sizing on a tree. Oper. Res. Lett. 36(1): 7-13 (2008)

Michele Conforti, Marco Di Summa, Laurence A. Wolsey: The Mixing Set with Divisible Capacities. IPCO 2008: 435-449

Santanu S. Dey, Laurence A. Wolsey: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO 2008: 463-475

Laurence A. Wolsey: Mixed Integer Programming. Wiley Encyclopedia of Computer Science and Engineering 2008

Quentin Louveaux, Laurence A. Wolsey: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Annals OR 153(1): 47-77 (2007)

Michele Conforti, Marco Di Summa, Laurence A. Wolsey: The Mixing Set with Flows. SIAM J. Discrete Math. 21(2): 396-407 (2007)

Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey: Inequalities from Two Rows of a Simplex Tableau. IPCO 2007: 1-15

Michele Conforti, Marco Di Summa, Laurence A. Wolsey: The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO 2007: 352-366

Pascal Van Hentenryck, Laurence A. Wolsey (Eds.): Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings. Lecture Notes in Computer Science 4510, Springer 2007, isbn 978-3-540-72396-7

Ruslan Sadykov, Laurence A. Wolsey: Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS Journal on Computing 18(2): 209-217 (2006)

Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey: Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105(2-3): 157-160 (2006)

Mathieu Van Vyve, Laurence A. Wolsey: Approximate extended formulations. Math. Program. 105(2-3): 501-522 (2006)

Laurence A. Wolsey: Lot-sizing with production and delivery time windows. Math. Program. 107(3): 471-489 (2006)

Matthias Köppe, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey: Extended formulations for Gomory Corner polyhedra. Discrete Optimization 1(2): 141-165 (2004)

Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey: On the cut polyhedron. Discrete Mathematics 277(1-3): 279-285 (2004)

Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey: On unions and dominants of polytopes. Math. Program. 99(2): 223-239 (2004)

Quentin Louveaux, Laurence A. Wolsey: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1(3): 173-207 (2003)

Andrew J. Miller, Laurence A. Wolsey: Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems. Operations Research 51(4): 557-565 (2003)

Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey: The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. 94(2-3): 189-191 (2003)

Marko Loparic, Hugues Marchand, Laurence A. Wolsey: Dynamic knapsack sets and capacitated lot-sizing. Math. Program. 95(1): 53-69 (2003)

Laurence A. Wolsey: Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math. Program. 97(1-2): 423-447 (2003)

Andrew J. Miller, Laurence A. Wolsey: Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98(1-3): 73-88 (2003)

Francisco Ortega, Laurence A. Wolsey: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3): 143-158 (2003)

Karen Aardal, Robert Weismantel, Laurence A. Wolsey: Non-standard approaches to integer programming. Discrete Applied Mathematics 123(1-3): 5-74 (2002)

Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey: Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics 123(1-3): 397-446 (2002)

Quentin Louveaux, Laurence A. Wolsey: Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs. Math. Oper. Res. 27(3): 470-484 (2002)

Jean-François Macq, Laurence A. Wolsey, Benoît Macq: A rendezvous point selection algorithm for videoconferencing applications. ICME (1) 2002: 689-692

Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey: Scheduling projects with labor constraints. Discrete Applied Mathematics 112(1-3): 27-52 (2001)

Olivier Pereira, Laurence A. Wolsey: On the Wagner-Whitin Lot-Sizing Polyhedron. Math. Oper. Res. 26(3): 591-600 (2001)

Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey: Cutting planes for integer programs with general integer variables. Math. Program. 81: 201-214 (1998)

Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey: The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998)

Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey: Decomposition of Integer Programs and of Generating Sets. ESA 1997: 92-102

Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996)

Yves Pochet, Laurence A. Wolsey: Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. Discrete Applied Mathematics 59(1): 57-74 (1995)

El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey: Optimizing constrained subtrees of trees. Math. Program. 71: 113-126 (1995)

El Houssaine Aghezzaf, Laurence A. Wolsey: Modelling piecewise linear concave costs in a tree partitioning problem. Discrete Applied Mathematics 50(2): 101-109 (1994)

Yves Pochet, Laurence A. Wolsey: Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67: 297-323 (1994)

C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey: Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. SIAM J. Discrete Math. 7(1): 141-151 (1994)

Denis Vanderstraeten, O. Zone, R. Keunings, Laurence A. Wolsey: Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations. PPSC 1993: 929-932

Giovanni Rinaldi, Laurence A. Wolsey (Eds.): Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993. CIACO 1993

Laurence A. Wolsey: Book review. Math. Meth. of OR 36(1): 92 (1992)

Jorge P. Sousa, Laurence A. Wolsey: A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54: 353-367 (1992)

Yves Pochet, Laurence A. Wolsey: Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. IPCO 1992: 150-164

Martin E. Dyer, Laurence A. Wolsey: Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics 26(2-3): 255-270 (1990)

Laurence A. Wolsey: Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints. Discrete Applied Mathematics 29(2-3): 251-261 (1990)

George L. Nemhauser, Laurence A. Wolsey: A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. Math. Program. 46: 379-390 (1990)

George L. Nemhauser, Laurence A. Wolsey: Integer and combinatorial optimization. Wiley interscience series in discrete mathematics and optimization, Wiley 1988, isbn 978-0-471-82819-8, pp. I-XIV, 1-763

Imre Bárány, Jack Edmonds, Laurence A. Wolsey: Packing and covering a tree by subtrees. Combinatorica 6(3): 221-233 (1986)

Laurence A. Wolsey: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4): 385-393 (1982)

Laurence A. Wolsey: Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting. J. Comb. Theory, Ser. A 23(1): 78-87 (1977)