Laurence A. Wolsey

ORCID

Publication Activity (10 Years)

Years Active: 1971-2023
Publications (10 Years): 19

Top Venues

Publications

Karen I. Aardal, Lara Scavuzzo, Laurence A. Wolsey
A study of lattice reformulations for integer programming. Oper. Res. Lett. 51 (4) (2023)
Dieter Weninger, Laurence A. Wolsey
Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing. Eur. J. Oper. Res. 310 (1) (2023)
Agostinho Agra, Marielle Christiansen, Laurence A. Wolsey
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 297 (1) (2022)
Karen Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey
Lattice Reformulation Cuts. SIAM J. Optim. 31 (4) (2021)
Laurence A. Wolsey, Hande Yaman
Convex hull results for generalizations of the constant capacity single node flow set. Math. Program. 187 (1) (2021)
Daniele Catanzaro, Raffaele Pesenti, Laurence A. Wolsey
On the Balanced Minimum Evolution polytope. Discret. Optim. 36 (2020)
Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey
The item dependent stockingcost constraint. Constraints An Int. J. 24 (2) (2019)
Michele Conforti, Laurence A. Wolsey
"Facet" separation with one linear program. Math. Program. 178 (1-2) (2019)
Maurice Queyranne, Laurence A. Wolsey
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons. J. Comb. Optim. 36 (1) (2018)
Laurence A. Wolsey, Hande Yaman
Convex hull results for the warehouse problem. Discret. Optim. 30 (2018)
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. 52 (3) (2018)
Laurence A. Wolsey
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds. Math. Program. 161 (1-2) (2017)
Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey
The Weighted Arborescence Constraint. CPAIOR (2017)
Maurice Queyranne, Laurence A. Wolsey
Tight MIP formulations for bounded up/down times and interval-dependent start-ups. Math. Program. 164 (1-2) (2017)
Laurence A. Wolsey, Hande Yaman
Continuous knapsack sets with divisible capacities. Math. Program. 156 (1-2) (2016)
Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey
The continuous knapsack set. Math. Program. 155 (1-2) (2016)
Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65 (2) (2015)
Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz
Sufficiency of cut-generating functions. Math. Program. 152 (1-2) (2015)
Maurice Queyranne, Laurence A. Wolsey
Modeling Poset Convex Subsets. CTW (2015)
Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26 (2) (2014)
Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey
Covering Linear Programming with Violations. INFORMS J. Comput. 26 (3) (2014)
Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey, Yves Deville
The StockingCost Constraint. CP (2014)
Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman
Relaxations for two-level multi-item lot-sizing problems. Math. Program. 146 (1-2) (2014)
Julien M. Hendrickx, Raphaël M. Jungers, Guillaume Vankeerberghen, Laurence A. Wolsey
An efficient technique for solving the scheduling of appliances in smart-homes. ACC (2014)
Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey
A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62 (4) (2013)
Mathieu Van Vyve, Laurence A. Wolsey
Strong and compact relaxations in the original space using a compact extended formulation. EURO J. Comput. Optim. 1 (1-2) (2013)
Rafael A. Melo, Laurence A. Wolsey
MIP formulations and heuristics for two-level production-transportation problems. Comput. Oper. Res. 39 (11) (2012)
Céline Gicquel, Laurence A. Wolsey, Michel Minoux
On discrete lot-sizing and scheduling on identical parallel machines. Optim. Lett. 6 (3) (2012)
Marco Di Summa, Laurence A. Wolsey
Mixing Sets Linked by Bidirected Paths. SIAM J. Optim. 21 (4) (2011)
Marco Di Summa, Laurence A. Wolsey
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 25 (2) (2011)
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) (2010)
Rafael A. Melo, Laurence A. Wolsey
Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38 (4) (2010)
Marco Di Summa, Laurence A. Wolsey
Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 24 (3) (2010)
Rafael A. Melo, Laurence A. Wolsey
Optimizing production and transportation in a commit-to-delivery business mode. Eur. J. Oper. Res. 203 (3) (2010)
Santanu S. Dey, Laurence A. Wolsey
Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. 7 (4) (2010)
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. Comput. Oper. Res. 37 (1) (2010)
Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35 (3) (2010)
Santanu S. Dey, Laurence A. Wolsey
Two row mixed-integer cuts via lifting. Math. Program. 124 (1-2) (2010)
Santanu S. Dey, Laurence A. Wolsey
Constrained Infinite Group Relaxations of MIPs. SIAM J. Optim. 20 (6) (2010)
Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
Experiments with Two Row Tableau Cuts. IPCO (2010)
Yves Pochet, Laurence A. Wolsey
Single item lot-sizing with non-decreasing capacities. Math. Program. 121 (1) (2010)
Karen Aardal, Laurence A. Wolsey
Lattice based extended formulations for integer linear equality systems. Math. Program. 121 (2) (2010)
Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34 (1) (2009)
Shoshana Anily, Michal Tzur, Laurence A. Wolsey
Multi-item lot-sizing with joint set-up costs. Math. Program. 119 (1) (2009)
Kurt M. Anstreicher, Laurence A. Wolsey
Two "well-known" properties of subgradient optimization. Math. Program. 120 (1) (2009)
Marco Di Summa, Laurence A. Wolsey
Lot-sizing on a tree. Oper. Res. Lett. 36 (1) (2008)
Santanu S. Dey, Laurence A. Wolsey
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO (2008)
Michele Conforti, Laurence A. Wolsey
Compact formulations as a union of polyhedra. Math. Program. 114 (2) (2008)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Mixing Set with Divisible Capacities. IPCO (2008)
Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
Inequalities from Two Rows of a Simplex Tableau. IPCO (2007)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Mixing Set with Flows. SIAM J. Discret. Math. 21 (2) (2007)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO (2007)
Quentin Louveaux, Laurence A. Wolsey
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Ann. Oper. Res. 153 (1) (2007)
Mathieu Van Vyve, Laurence A. Wolsey
Approximate extended formulations. Math. Program. 105 (2-3) (2006)
Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105 (2-3) (2006)
Laurence A. Wolsey
Lot-sizing with production and delivery time windows. Math. Program. 107 (3) (2006)
Ruslan Sadykov, Laurence A. Wolsey
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J. Comput. 18 (2) (2006)
Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey
On unions and dominants of polytopes. Math. Program. 99 (2) (2004)
Matthias Köppe, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
Extended formulations for Gomory Corner polyhedra. Discret. Optim. 1 (2) (2004)
Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey
On the cut polyhedron. Discret. Math. 277 (1-3) (2004)
Bram Verweij, Laurence A. Wolsey
Uncapacitated lot-sizing with buying, sales and backlogging. Optim. Methods Softw. 19 (3-4) (2004)
Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. 94 (2-3) (2003)
Andrew J. Miller, Laurence A. Wolsey
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems. Oper. Res. 51 (4) (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) (2003)
Marko Loparic, Hugues Marchand, Laurence A. Wolsey
Dynamic knapsack sets and capacitated lot-sizing. Math. Program. 95 (1) (2003)
Francisco Ortega, Laurence A. Wolsey
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41 (3) (2003)
Laurence A. Wolsey
Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math. Program. 97 (1-2) (2003)
Quentin Louveaux, Laurence A. Wolsey
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1 (3) (2003)
Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey
Cutting planes in integer and mixed integer programming. Discret. Appl. Math. 123 (1-3) (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) (2002)
Laurence A. Wolsey
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation. Manag. Sci. 48 (12) (2002)
Karen Aardal, Robert Weismantel, Laurence A. Wolsey
Non-standard approaches to integer programming. Discret. Appl. Math. 123 (1-3) (2002)
Jean-François Macq, Laurence A. Wolsey, Benoît Macq
A rendezvous point selection algorithm for videoconferencing applications. ICME (1) (2002)
Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey
Scheduling projects with labor constraints. Discret. Appl. Math. 112 (1-3) (2001)
Olivier Pereira, Laurence A. Wolsey
On the Wagner-Whitin Lot-Sizing Polyhedron. Math. Oper. Res. 26 (3) (2001)
Gaetan Belvaux, Laurence A. Wolsey
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs. Manag. Sci. 47 (7) (2001)
Marko Loparic, Yves Pochet, Laurence A. Wolsey
The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. 89 (3) (2001)
Hugues Marchand, Laurence A. Wolsey
Aggregation and Mixed Integer Rounding to Solve MIPs. Oper. Res. 49 (3) (2001)
Cécile Cordier, Hugues Marchand, Richard Laundy, Laurence A. Wolsey
: a branch-and-cut code for mixed integer programs. Math. Program. 86 (2) (1999)
Hugues Marchand, Laurence A. Wolsey
The 0-1 Knapsack problem with a single continuous variable. Math. Program. 85 (1) (1999)
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 (1998)
Gaetan Belvaux, Nicolas Boissin, Alain S. Sutter, Laurence A. Wolsey
Optimal placement of add /drop multiplexers static and dynamic models. Eur. J. Oper. Res. 108 (1) (1998)
Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey
Cutting planes for integer programs with general integer variables. Math. Program. 81 (1998)
Alain S. Sutter, François Vanderbeck, Laurence A. Wolsey
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. 46 (5) (1998)
Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
Decomposition of Integer Programs and of Generating Sets. ESA (1997)
François Vanderbeck, Laurence A. Wolsey
An exact algorithm for IP column generation. Oper. Res. Lett. 19 (4) (1996)
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 (1996)
El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey
Optimizing constrained subtrees of trees. Math. Program. 71 (1995)
Karen Aardal, Yves Pochet, Laurence A. Wolsey
Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. 20 (3) (1995)
Yves Pochet, Laurence A. Wolsey
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. Discret. Appl. Math. 59 (1) (1995)
El Houssaine Aghezzaf, Laurence A. Wolsey
Modelling piecewise linear concave costs in a tree partitioning problem. Discret. Appl. Math. 50 (2) (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. Discret. Math. 7 (1) (1994)
Yves Pochet, Laurence A. Wolsey
Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67 (1994)
Yves Pochet, Laurence A. Wolsey
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities. Math. Oper. Res. 18 (4) (1993)
Yves Pochet, Laurence A. Wolsey
Algorithms and reformulations for lot sizing problems. Combinatorial Optimization (1993)
Denis Vanderstraeten, O. Zone, R. Keunings, Laurence A. Wolsey
Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations. PPSC (1993)
Laurence A. Wolsey
Book review. ZOR Methods Model. Oper. Res. 36 (1) (1992)
El Houssaine Aghezzaf, Laurence A. Wolsey
Lot-sizing polyhedra with a cardinality constraint. Oper. Res. Lett. 11 (1) (1992)
Jorge P. Sousa, Laurence A. Wolsey
A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54 (1992)
Yves Pochet, Laurence A. Wolsey
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. IPCO (1992)

Laurence A. Wolsey.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Laurence A. Wolsey