Laurence A. Wolsey


(Tel: 32 10 474307; e-mail: laurence.wolsey@uclouvain.be)

Professor, Université catholique de Louvain.

Ph.D. (mathematics), Massachusetts Institute of Technology, 1969.

Visiting researcher, Manchester Business School, 1969--1971; London School of Economics, 1978--1979; Cornell University, 1983; visiting professor, Ecole polytechnique de Lausanne, 1986--1987; Donders professor, University of Utrecht 1998.

Operations research and applied mathematics.

Member of the Council of the Mathematical Programming Society, 1976--1979; past associate editor, Operations Research Letters; past co-editor, Mathematical Programming.  Editor-in-chief  Mathematical Programming 1999-2003.


RECENT CORE PUBLICATIONS

DP 2010/63 M. DI SUMMA and  L.A. WOLSEY, Mixing Sets linked by Bidirected Paths

 

CORE Reprints
1498. M. LOPARIC, Y. POCHET and L.A. WOLSEY,The Uncapacitated Lot-Sizing Problem with Sales and Safety Stocks. Mathematical Programming 89, 487-504, 2001
1513. H. MARCHAND and L. A. WOLSEY. Aggregation and Mixed Integer Rounding to solve MIPs. Operations Research 49, 363-371, 2001
1516. G. BELVAUX and L.A. WOLSEY, Modelling Practical Lot-Sizing Problems as Mixed Integer Programs, Management Science 47, 993-1007, 2001
1517 O. PEREIRA and L.A. WOLSEY, On the Wagner-Whitin Lot-Sizing Polyhedron, Mathematics of Operations Research 26, 591-600, 2001
1520 C.C CAVALCANTE, C. de SOUZA, M.W.P. SAVELSBERGH, Y. WONG and L.A. WOLSEY. Scheduling Projects with Labor Constraints. Discrete Applied Mathematics 112,27-52, 2001
1567 H. MARCHAND, A. MARTIN, R. WEISMANTEL and L.A. WOLSEY. Cutting Planes in Integer and Mixed Integer Programming. Discrete Applied Mathematics 123,397-446, 2002
1568 K. AARDAL, R. WEISMANTEL and L.A. WOLSEY Non-Standard Approaches to Integer Programming. Discrete Applied Mathematics 123,5-74, 2002
1571 Q. LOUVEAUX and L.A. WOLSEY. Combining Problem Structure with Basis Reduction to solve a Class of Hard Integer Programs. Mathematics of Operations Research 27, 470-484, 2002 1600 M. LOPARIC, H. MARCHAND and L.A. WOLSEY, Dynamic Knapsack Sets and Capacitated Lot-Sizing, Mathematical Programming, Series B, 95,53-69 (2003) ps
1605 L.A. WOLSEY, Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation, Management Science 48, 1587-1602 (2002) pdf 1611 F. ORTEGA and L.A. WOLSEY, A Branch-and-Cut algorithm for the single commodity uncapacitated fixed charge network flow problem, Networks 41, 143-158 (2003) ps
1627 L.A. WOLSEY, Strong formulations for mixed integer programs: valid inequalities and extended formulations, Mathematical Programming B 97, 423-447 (2003)  pdf
1639 A. MILLER and L.A. WOLSEY, Formulations for multi-item discrete lot-sizing problems, Operations Research 51, 557-565 (2003) pdf
1653 A. MILLER and L.A. WOLSEY, Tight formulations for some simple mixed integer programs and convex objective integer programs, Mathematical Programming B 98, 73-88 (2003) pdf
1659 Q. LOUVEAUX and L.A. WOLSEY. Lifting, Superadditivity, Mixed Integer Rounding and Single Node Flow Sets Revisited, 4OR 1, 173-208 (2003) pdf
1684 E. BALAS, A. BOCKMAYR, N. PISARUK and L.A. WOLSEY, On Unions and Dominants of Polytopes, Mathematical Programming 99, 223-239 (2004) ps
1693. M. CONFORTI, G. RINALDI and L.A. WOLSEY, On the Cut Polyhedron, Discrete Mathematics 277, 279-285 (2004) ps
1704 B. VERWEIJ and L.A. WOLSEY, Uncapacitated lot-sizing with buying, selling and backlogging, Optimization Methods and Software 19, 427-436 (2004) ps
1728 M. KOEPPE, Q. LOUVEAUX, R. WEISMANTEL and L.A. WOLSEY, Extended Formulations for Gomory Polyhedra, Discrete Optimization 1, 141-165 (2004) ps
1807 M. VAN VYVE and L.A. WOLSEY, Approximate Extended Formulations, Mathematical Programming B, 105, 501--522 (2006) pdf
1844. L.A. WOLSEY, Lot-sizing with Production and Delivery Time Windows, Mathematical Programming A, 107, 471--489 (2006) pdf
1854 R. SADYKOV and L.A. WOLSEY, Integer programming and constraint programming in solving a multimachine assignment problem with deadlines and release dates, INFORMS J. on Computing 18, 209-217 (2006) pdf
1940 M. CONFORTI, M. DI SUMMA and L.A. WOLSEY, The Mixing Set with Flows, SIAM J. of Discrete Mathematics 29, 396-407 (2007). pdf

2032 M. CONFORTI and L.A. WOLSEY, Compact formulations as unions of polyhedra, Mathematical Programming, Ser. A 114, 277-289, 2008 The original publication is available at www.springerlink.com http://www.springerlink.com/content/f877m812276x26h8/ pdf
2036 M. DI SUMMA and L.A. WOLSEY, Lot-Sizing on a Tree, Operations Research Letters 36,7-13 (2008). pdf

2065 S.S. DEY, L. A. WOLSEY, Lifting Integer Variables In Minimal Inequalities Corresponding to Lattice-Free Triangles, in A. Lodi, A. Panconesi, G. Rinaldi, eds., IPCO 2008, Springer Lecture Notes in Computer Science LNCS 5035, 463-474, 2008.
2073 Y. POCHET, M. VAN VYVE and L.A. WOLSEY, LS-LIB: A Library of tools for Solving Production Planning Problems, in Research Trends in Combinatorial Optimization, eds., W. Cook, L. Lovasz and J. Vygen, Springer 317-346 (2009).

2081 S. ANILY, M. TZUR and L.A. WOLSEY, Multi-Item Lot-Sizing with Joint Set-Up Costs, Mathematical Programming, 119, 79--94. (2009),

2145 Y. POCHET and L.A. WOLSEY Single Item Lot-Sizing with Non-decreasing Capacities, Math. Program., Ser. A (2010) 121:123–143 (pdf
2146 M. CONFORTI, M. DI SUMMA, F. EISENBRAND, and L. A. WOLSEY Network Formulations of Mixed-Integer Programs, Mathematics of Operations Research 34, 194--209 (2009).

2102 K. ANSTREICHER and L.A. WOLSEY, Two ÒWell-KnownÓ Properties of Subgradient Optimization, Mathematical Programming B 120, 213--220 (2009).

2188. F. VANDERBECK and L.A. WOLSEY, Reformulation and Decomposition of Integer Programs in M. Juenger et al. (eds.) 50 Years of Integer Programming 1958-2008, Berlin, Heidelberg, Springer-Verlag 431-502, 2010

2191 N. BRAHIMI, S. DAUZERE-PERES and L.A. WOLSEY, Polyhedral and Lagrangian approaches for lot sizing with production time windows and

setup times, Computers & Operations Research 37 (2010) 182 -- 188,

2192 K. AARDAL and L.A. WOLSEY Lattice based extended formulations for integer linear equality systems, Math. Program., Ser. A (2010) 121:337–352)

2193 R. MELO and L.A. WOLSEY  Optimizing Production and Transportation in a Commit-to-Delivery Business Mode, European Journal of Operational Research 203 (2010) 614–618

2235 R. MELO and L.A. WOLSEY, Uncapacitated Two-Level Lot-Sizing, Operations Research Letters 38, 241-245 (2010)

2254 S.S. DEY and L.A. WOLSEY, Two row mixed integer cuts via lifting, Mathematical Programming B, 124, 143-174 (2010).

2255 M. Di SUMMA and L.A. WOLSEY, Lot-Sizing with Stock Upper Bounds and Fixed Charges, SIAM J. on Discrete Math 24, 853–875, 2010

CORRECTION: pdf

2256 M. CONFORTI, L.A. WOLSET and G. ZAMBELLI, Projecting and Extended Formulation for Mixed-Integer Covers on Bipartite Graphs, Mathematics of Operations Research 35, 603-623, 2010.

2314 S.S. DEY and L.A. WOLSEY, Constrained Infinite Group Relaxations of MIPs, SIAM J. of Optimization, 20, 2890-2912, 2010.

2315 S.S. DEY and L.A. WOLSEY, Composite Lifting of Group Inequalities and an Application to Two-Row Mixing Inequalities, Discrete Optimization 7,256-268, 2010.

Xxxx C. GICQUEL, M. MINOUX and L.A. WOLSEY, On Discrete Lot-Sizing and Scheduling on Identical Parallel Machines", to appear in Optimization Letters.          DOI : 10.1007/s11590-011-0280-8.

 

 

 

 

+

 

-         

BOOKS

Integer and Combinatorial Optimization / G.L. NEMHAUSER and L.A. WOLSEY. New York : Wiley, 1988.
Economic Decision-Making : Games, Econometrics and Optimisation. Contributions in Honour of Jacques H. Drèze / J.J. GABSZEWICZ, J.-F. RICHARD and L.A. WOLSEY (eds). Amsterdam : North-Holland, 1990.
Integer Programming and Combinatorial Optimization : Proceedings of a Conference held at Centro Ettore Majorana, Erice. April 29 - May 1, 1993 / G. RINALDI and L.A. WOLSEY (eds). Louvain-la-Neuve : CIACO, 1993.
Integer Programming /   L.A. WOLSEY. New York : Wiley, 1998.
Production Planning by Mixed Integer Programming /   Y. POCHET and L.A. WOLSEY. New York : Springer, 2006.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems /   P. VAN HENTENRYCK and L.A. WOLSEY (eds.) Proceedings of CPAIOR 2007, Brussels, May 2007, LNCS 4510, Springer 2007

50 Years of Integer Programming 1958-2008 The Early Years and State-of-the-Art Surveys

M. JUENGER, M.; Th.M. LIEBLING.; D. NADDEF.; G.L. NEMHAUSER.; W.R. PULLEYBLANK.; G. REINELT.; G. RINALDI.; L.A. WOLSEY. (Eds.), Springer  2010,

 

OTHER

K. ANDERSEN, Q. LOUVEAUX, R. WEISMANTEL and L.A. WOLSEY, Cutting Planes from Two Rows of a Simplex Tableau, Proceedings of IPCO XII, Ithaca, New York, 1-15 (2007).
M. CONFORTI, M. DI SUMMA and L.A. WOLSEY, The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows, Proceedings of IPCO XII, (eds., M. Fischetti and D.P. Williamson), Springer-Verlag 2007
M. CONFORTI, M. DI SUMMA and L.A. WOLSEY, The mixing set with divisible capacities IPCO 2008, Proceedings,, eds.A. Lodi, A. Panconesi, G. Rinaldi, Springer LNCS 5035, 435-449, 2008.

S.S. DEY, A. LODI, A. TRAMONTANI and L. A. WOLSEY, Experiments With Two Row Tableau Cuts, IPCO 2010

 

Useful pointers:   homepage, CORE

9th April 2009
Author : Laurence Wolsey <>
Responsible : Laurence Wolsey < >