| * | 2009 |
|---|
| 46 | EE | Michele Conforti,
Marco Di Summa,
Friedrich Eisenbrand,
Laurence A. Wolsey:
Network Formulations of Mixed-Integer Programs.
Math. Oper. Res. 34(1): 194-209 (2009) |
| 2008 |
|---|
| 45 | EE | Michele Conforti,
Marco Di Summa,
Laurence A. Wolsey:
The Mixing Set with Divisible Capacities.
IPCO 2008: 435-449 |
| 44 | EE | Santanu S. Dey,
Laurence A. Wolsey:
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.
IPCO 2008: 463-475 |
| 43 | EE | Laurence A. Wolsey:
Mixed Integer Programming.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
| 42 | EE | Michele Conforti,
Laurence A. Wolsey:
Compact formulations as a union of polyhedra.
Math. Program. 114(2): 277-289 (2008) |
| 41 | EE | Marco Di Summa,
Laurence A. Wolsey:
Lot-sizing on a tree.
Oper. Res. Lett. 36(1): 7-13 (2008) |
| 2007 |
|---|
| 40 | | Pascal Van Hentenryck,
Laurence A. Wolsey:
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
Springer 2007 |
| 39 | EE | Kent Andersen,
Quentin Louveaux,
Robert Weismantel,
Laurence A. Wolsey:
Inequalities from Two Rows of a Simplex Tableau.
IPCO 2007: 1-15 |
| 38 | EE | 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 |
| 37 | EE | Quentin Louveaux,
Laurence A. Wolsey:
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.
Annals OR 153(1): 47-77 (2007) |
| 36 | EE | Michele Conforti,
Marco Di Summa,
Laurence A. Wolsey:
The Mixing Set with Flows.
SIAM J. Discrete Math. 21(2): 396-407 (2007) |
| 2006 |
|---|
| 35 | EE | 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) |
| 34 | EE | 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) |
| 33 | EE | Mathieu Van Vyve,
Laurence A. Wolsey:
Approximate extended formulations.
Math. Program. 105(2-3): 501-522 (2006) |
| 32 | EE | Laurence A. Wolsey:
Lot-sizing with production and delivery time windows.
Math. Program. 107(3): 471-489 (2006) |
| 2004 |
|---|
| 31 | EE | Michele Conforti,
Giovanni Rinaldi,
Laurence A. Wolsey:
On the cut polyhedron.
Discrete Mathematics 277(1-3): 279-285 (2004) |
| 30 | EE | Matthias Köppe,
Quentin Louveaux,
Robert Weismantel,
Laurence A. Wolsey:
Extended formulations for Gomory Corner polyhedra.
Discrete Optimization 1(2): 141-165 (2004) |
| 29 | EE | Egon Balas,
Alexander Bockmayr,
Nicolai Pisaruk,
Laurence A. Wolsey:
On unions and dominants of polytopes.
Math. Program. 99(2): 223-239 (2004) |
| 2003 |
|---|
| 28 | EE | Quentin Louveaux,
Laurence A. Wolsey:
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.
4OR 1(3): 173-207 (2003) |
| 27 | EE | Marko Loparic,
Hugues Marchand,
Laurence A. Wolsey:
Dynamic knapsack sets and capacitated lot-sizing.
Math. Program. 95(1): 53-69 (2003) |
| 26 | EE | 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) |
| 25 | EE | Andrew J. Miller,
Laurence A. Wolsey:
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems.
Operations Research 51(4): 557-565 (2003) |
| 2002 |
|---|
| 24 | | 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) |
| 23 | | Karen Aardal,
Robert Weismantel,
Laurence A. Wolsey:
Non-standard approaches to integer programming.
Discrete Applied Mathematics 123(1-3): 5-74 (2002) |
| 22 | EE | 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) |
| 2001 |
|---|
| 21 | | 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) |
| 20 | EE | Olivier Pereira,
Laurence A. Wolsey:
On the Wagner-Whitin Lot-Sizing Polyhedron.
Math. Oper. Res. 26(3): 591-600 (2001) |
| 1998 |
|---|
| 19 | | 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) |
| 18 | | 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) |
| 1997 |
|---|
| 17 | EE | Gérard Cornuéjols,
Regina Urbaniak,
Robert Weismantel,
Laurence A. Wolsey:
Decomposition of Integer Programs and of Generating Sets.
ESA 1997: 92-102 |
| 1996 |
|---|
| 16 | | 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) |
| 1995 |
|---|
| 15 | EE | 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) |
| 14 | | El Houssaine Aghezzaf,
Thomas L. Magnanti,
Laurence A. Wolsey:
Optimizing constrained subtrees of trees.
Math. Program. 71: 113-126 (1995) |
| 1994 |
|---|
| 13 | | El Houssaine Aghezzaf,
Laurence A. Wolsey:
Modelling piecewise linear concave costs in a tree partitioning problem.
Discrete Applied Mathematics 50(2): 101-109 (1994) |
| 12 | | Yves Pochet,
Laurence A. Wolsey:
Polyhedra for lot-sizing with Wagner-Whitin costs.
Math. Program. 67: 297-323 (1994) |
| 11 | EE | C. P. M. van Hoesel,
Albert P. M. Wagelmans,
Laurence A. Wolsey:
Polyhedral Characterization of the Economic Lot-Sizing Problemwith Start-Up Costs.
SIAM J. Discrete Math. 7(1): 141-151 (1994) |
| 1993 |
|---|
| 10 | | Giovanni Rinaldi,
Laurence A. Wolsey:
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993
CIACO 1993 |
| 9 | | 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 |
| 1992 |
|---|
| 8 | | Yves Pochet,
Laurence A. Wolsey:
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems.
IPCO 1992: 150-164 |
| 7 | | Jorge P. Sousa,
Laurence A. Wolsey:
A time indexed formulation of non-preemptive single machine scheduling problems.
Math. Program. 54: 353-367 (1992) |
| 1990 |
|---|
| 6 | EE | 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) |
| 5 | EE | 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) |
| 4 | | 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) |
| 1986 |
|---|
| 3 | | Imre Bárány,
Jack Edmonds,
Laurence A. Wolsey:
Packing and covering a tree by subtrees.
Combinatorica 6(3): 221-233 (1986) |
| 1982 |
|---|
| 2 | | Laurence A. Wolsey:
An analysis of the greedy algorithm for the submodular set covering problem.
Combinatorica 2(4): 385-393 (1982) |
| 1977 |
|---|
| 1 | | Laurence A. Wolsey:
Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting.
J. Comb. Theory, Ser. A 23(1): 78-87 (1977) |
