Laurence A. Wolsey

140 papers A 2B 9C 2Journal 119Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Optimizing over path-length matrices of unrooted binary trees. Math. Program. Daniele Catanzaro, Raffaele Pesenti, Allan Sapucaia, Laurence A. Wolsey
2023	J	`jnl`	A study of lattice reformulations for integer programming. Oper. Res. Lett. Karen I. Aardal, Lara Scavuzzo, Laurence A. Wolsey
2023	J	`jnl`	Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing. Eur. J. Oper. Res. Dieter Weninger, Laurence A. Wolsey
2022	J	`jnl`	Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. Agostinho Agra, Marielle Christiansen, Laurence A. Wolsey
2021	J	`jnl`	Convex hull results for generalizations of the constant capacity single node flow set. Math. Program. Laurence A. Wolsey, Hande Yaman
2021	J	`jnl`	Lattice Reformulation Cuts. SIAM J. Optim. Karen I. Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey
2020	J	`jnl`	On the Balanced Minimum Evolution polytope. Discret. Optim. Daniele Catanzaro, Raffaele Pesenti, Laurence A. Wolsey
2019	J	`jnl`	"Facet" separation with one linear program. Math. Program. Michele Conforti, Laurence A. Wolsey
2019	J	`jnl`	The item dependent stockingcost constraint. Constraints An Int. J. Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey
2018	J	`jnl`	Convex hull results for the warehouse problem. Discret. Optim. Laurence A. Wolsey, Hande Yaman
2018	J	`jnl`	Optimum turn-restricted paths, nested compatibility, and optimum convex polygons. J. Comb. Optim. Maurice Queyranne, Laurence A. Wolsey
2018	J	`jnl`	Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
2017	J	`jnl`	Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds. Math. Program. Laurence A. Wolsey
2017	B	`conf`	The Weighted Arborescence Constraint. CPAIOR Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey
2017	J	`jnl`	Tight MIP formulations for bounded up/down times and interval-dependent start-ups. Math. Program. Maurice Queyranne, Laurence A. Wolsey
2016	J	`jnl`	Continuous knapsack sets with divisible capacities. Math. Program. Laurence A. Wolsey, Hande Yaman
2016	J	`jnl`	The continuous knapsack set. Math. Program. Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey
2015	C	`conf`	Modeling Poset Convex Subsets. CTW Maurice Queyranne, Laurence A. Wolsey
2015	J	`jnl`	Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey
2015	J	`jnl`	Sufficiency of cut-generating functions. Math. Program. Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz
2014	C	`conf`	An efficient technique for solving the scheduling of appliances in smart-homes. ACC Julien M. Hendrickx, Raphaël M. Jungers, Guillaume Vankeerberghen, Laurence A. Wolsey
2014	J	`jnl`	Covering Linear Programming with Violations. INFORMS J. Comput. Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey
2014	J	`jnl`	On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
2014	J	`jnl`	Relaxations for two-level multi-item lot-sizing problems. Math. Program. Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman
2014	A	`conf`	The StockingCost Constraint. CP Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey, Yves Deville
2013	J	`jnl`	A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey
2013	J	`jnl`	Strong and compact relaxations in the original space using a compact extended formulation. EURO J. Comput. Optim. Mathieu Van Vyve, Laurence A. Wolsey
2012	J	`jnl`	MIP formulations and heuristics for two-level production-transportation problems. Comput. Oper. Res. Rafael A. Melo, Laurence A. Wolsey
2012	J	`jnl`	On discrete lot-sizing and scheduling on identical parallel machines. Optim. Lett. Céline Gicquel, Laurence A. Wolsey, Michel Minoux
2011	J	`jnl`	Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. Marco Di Summa, Laurence A. Wolsey
2011	J	`jnl`	Mixing Sets Linked by Bidirected Paths. SIAM J. Optim. Marco Di Summa, Laurence A. Wolsey
2010	—	`book`	50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010	J	`jnl`	Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. Santanu S. Dey, Laurence A. Wolsey
2010	J	`jnl`	Constrained Infinite Group Relaxations of MIPs. SIAM J. Optim. Santanu S. Dey, Laurence A. Wolsey
2010	B	`conf`	Experiments with Two Row Tableau Cuts. IPCO Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
2010	J	`jnl`	Lattice based extended formulations for integer linear equality systems. Math. Program. Karen I. Aardal, Laurence A. Wolsey
2010	J	`jnl`	Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. Marco Di Summa, Laurence A. Wolsey
2010	J	`jnl`	Optimizing production and transportation in a commit-to-delivery business mode. Eur. J. Oper. Res. Rafael A. Melo, Laurence A. Wolsey
2010	J	`jnl`	Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times. Comput. Oper. Res. Nadjib Brahimi, Stéphane Dauzère-Pérès, Laurence A. Wolsey
2010	J	`jnl`	Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli
2010	—	`ch.`	Reformulation and Decomposition of Integer Programs. 50 Years of Integer Programming François Vanderbeck, Laurence A. Wolsey
2010	J	`jnl`	Single item lot-sizing with non-decreasing capacities. Math. Program. Yves Pochet, Laurence A. Wolsey
2010	J	`jnl`	Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010	J	`jnl`	Two row mixed-integer cuts via lifting. Math. Program. Santanu S. Dey, Laurence A. Wolsey
2010	J	`jnl`	Uncapacitated two-level lot-sizing. Oper. Res. Lett. Rafael A. Melo, Laurence A. Wolsey
2009	J	`jnl`	Multi-item lot-sizing with joint set-up costs. Math. Program. Shoshana Anily, Michal Tzur, Laurence A. Wolsey
2009	J	`jnl`	Network Formulations of Mixed-Integer Programs. Math. Oper. Res. Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey
2009	J	`jnl`	Two "well-known" properties of subgradient optimization. Math. Program. Kurt M. Anstreicher, Laurence A. Wolsey
2008	J	`jnl`	Compact formulations as a union of polyhedra. Math. Program. Michele Conforti, Laurence A. Wolsey
2008	B	`conf`	Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO Santanu S. Dey, Laurence A. Wolsey
2008	J	`jnl`	Lot-sizing on a tree. Oper. Res. Lett. Marco Di Summa, Laurence A. Wolsey
2008	—	`ch.`	Mixed Integer Programming. Wiley Encyclopedia of Computer Science and Engineering Laurence A. Wolsey
2008	B	`conf`	The Mixing Set with Divisible Capacities. IPCO Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2007	B	`conf`	Inequalities from Two Rows of a Simplex Tableau. IPCO Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
2007	B	`ed.`	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 CPAIOR Pascal Van Hentenryck, Laurence A. Wolsey
2007	J	`jnl`	Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Ann. Oper. Res. Quentin Louveaux, Laurence A. Wolsey
2007	B	`conf`	The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2007	J	`jnl`	The Mixing Set with Flows. SIAM J. Discret. Math. Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2006	J	`jnl`	Approximate extended formulations. Math. Program. Mathieu Van Vyve, Laurence A. Wolsey
2006	J	`jnl`	Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2006	J	`jnl`	Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J. Comput. Ruslan Sadykov, Laurence A. Wolsey
2006	J	`jnl`	Lot-sizing with production and delivery time windows. Math. Program. Laurence A. Wolsey
2004	J	`jnl`	Extended formulations for Gomory Corner polyhedra. Discret. Optim. Matthias Köppe, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
2004	J	`jnl`	On the cut polyhedron. Discret. Math. Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey
2004	J	`jnl`	On unions and dominants of polytopes. Math. Program. Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey
2004	—	`ch.`	Time for Old and New Faces. The Sharpest Cut Laurence A. Wolsey
2004	J	`jnl`	Uncapacitated lot-sizing with buying, sales and backlogging. Optim. Methods Softw. Bram Verweij, Laurence A. Wolsey
2003	J	`jnl`	A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks Francisco Ortega, Laurence A. Wolsey
2003	J	`jnl`	Dynamic knapsack sets and capacitated lot-sizing. Math. Program. Marko Loparic, Hugues Marchand, Laurence A. Wolsey
2003	J	`jnl`	Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR Quentin Louveaux, Laurence A. Wolsey
2003	J	`jnl`	Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math. Program. Laurence A. Wolsey
2003	J	`jnl`	The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2003	J	`jnl`	Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems. Oper. Res. Andrew J. Miller, Laurence A. Wolsey
2003	J	`jnl`	Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. Andrew J. Miller, Laurence A. Wolsey
2002	—	`conf`	A rendezvous point selection algorithm for videoconferencing applications. ICME (1) Jean-François Macq, Laurence A. Wolsey, Benoît Macq
2002	J	`jnl`	Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs. Math. Oper. Res. Quentin Louveaux, Laurence A. Wolsey
2002	J	`jnl`	Cutting planes in integer and mixed integer programming. Discret. Appl. Math. Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey
2002	J	`jnl`	Non-standard approaches to integer programming. Discret. Appl. Math. Karen I. Aardal, Robert Weismantel, Laurence A. Wolsey
2002	J	`jnl`	Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation. Manag. Sci. Laurence A. Wolsey
2001	J	`jnl`	Aggregation and Mixed Integer Rounding to Solve MIPs. Oper. Res. Hugues Marchand, Laurence A. Wolsey
2001	J	`jnl`	Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs. Manag. Sci. Gaetan Belvaux, Laurence A. Wolsey
2001	J	`jnl`	On the Wagner-Whitin Lot-Sizing Polyhedron. Math. Oper. Res. Olivier Pereira, Laurence A. Wolsey
2001	J	`jnl`	Scheduling projects with labor constraints. Discret. Appl. Math. Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey
2001	J	`jnl`	The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. Marko Loparic, Yves Pochet, Laurence A. Wolsey
1999	J	`jnl`	The 0-1 Knapsack problem with a single continuous variable. Math. Program. Hugues Marchand, Laurence A. Wolsey
1998	J	`jnl`	Cutting planes for integer programs with general integer variables. Math. Program. Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey
1998	J	`jnl`	Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. Alain S. Sutter, François Vanderbeck, Laurence A. Wolsey
1998	J	`jnl`	Optimal placement of add /drop multiplexers static and dynamic models. Eur. J. Oper. Res. Gaetan Belvaux, Nicolas Boissin, Alain S. Sutter, Laurence A. Wolsey
1998	J	`jnl`	The node capacitated graph partitioning problem: A computational study. Math. Program. Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey
1997	A	`conf`	Decomposition of Integer Programs and of Generating Sets. ESA Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
1996	J	`jnl`	An exact algorithm for IP column generation. Oper. Res. Lett. François Vanderbeck, Laurence A. Wolsey
1996	J	`jnl`	Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey
1995	J	`jnl`	Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. Karen I. Aardal, Yves Pochet, Laurence A. Wolsey
1995	J	`jnl`	Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. Discret. Appl. Math. Yves Pochet, Laurence A. Wolsey
1995	J	`jnl`	Optimizing constrained subtrees of trees. Math. Program. El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey
1994	J	`jnl`	Modelling piecewise linear concave costs in a tree partitioning problem. Discret. Appl. Math. El Houssaine Aghezzaf, Laurence A. Wolsey
1994	J	`jnl`	Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. Yves Pochet, Laurence A. Wolsey
1994	J	`jnl`	Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. SIAM J. Discret. Math. C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey
1993	—	`conf`	Algorithms and reformulations for lot sizing problems. Combinatorial Optimization Yves Pochet, Laurence A. Wolsey
1993	J	`jnl`	Lot-Sizing with Constant Batches: Formulation and Valid Inequalities. Math. Oper. Res. Yves Pochet, Laurence A. Wolsey
1993	—	`conf`	Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations. PPSC Denis Vanderstraeten, O. Zone, R. Keunings, Laurence A. Wolsey
1993	B	`ed.`	Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993 IPCO Giovanni Rinaldi, Laurence A. Wolsey
1992	J	`jnl`	A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. Jorge P. Sousa, Laurence A. Wolsey
1992	J	`jnl`	Book review. ZOR Methods Model. Oper. Res. Laurence A. Wolsey
1992	J	`jnl`	Lot-sizing polyhedra with a cardinality constraint. Oper. Res. Lett. El Houssaine Aghezzaf, Laurence A. Wolsey
1992	B	`conf`	Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. IPCO Yves Pochet, Laurence A. Wolsey
1991	J	`jnl`	Finding minimum cost directed trees with demands and capacities. Ann. Oper. Res. Choaib Bousba, Laurence A. Wolsey
1990	J	`jnl`	A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. Math. Program. George L. Nemhauser, Laurence A. Wolsey
1990	J	`jnl`	Formulating the single machine sequencing problem with release dates as a mixed integer program. Discret. Appl. Math. Martin E. Dyer, Laurence A. Wolsey
1990	J	`jnl`	Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints. Discret. Appl. Math. Laurence A. Wolsey
1989	J	`jnl`	Strong formulations for mixed integer programming: A survey. Math. Program. Laurence A. Wolsey
1989	J	`jnl`	Uncapacitated Lot-Sizing Problems with Start-Up Costs. Oper. Res. Laurence A. Wolsey
1988	—	`book`	Integer and Combinatorial Optimization. George L. Nemhauser, Laurence A. Wolsey
1988	J	`jnl`	Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Program. Yves Pochet, Laurence A. Wolsey
1987	J	`jnl`	Solving Mixed Integer Programming Problems Using Automatic Reformulation. Oper. Res. Tony J. Van Roy, Laurence A. Wolsey
1986	J	`jnl`	Packing and covering a tree by subtrees. Comb. Imre Bárány, Jack Edmonds, Laurence A. Wolsey
1986	J	`jnl`	Valid inequalities for mixed 0-1 programs. Discret. Appl. Math. Tony J. Van Roy, Laurence A. Wolsey
1985	J	`jnl`	Sensitivity Analysis for Branch and Bound Integer Programming. Oper. Res. Linus Schrage, Laurence A. Wolsey
1985	J	`jnl`	Valid Linear Inequalities for Fixed Charge Problems. Oper. Res. Manfred W. Padberg, Tony J. Van Roy, Laurence A. Wolsey
1984	J	`jnl`	Fractional covers for forests and matchings. Math. Program. Manfred Padberg, Laurence A. Wolsey
1982	J	`jnl`	An analysis of the greedy algorithm for the submodular set covering problem. Comb. Laurence A. Wolsey
1982	J	`jnl`	Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems. Math. Oper. Res. Laurence A. Wolsey
1982	J	`jnl`	On the use of penumbras in blocking and antiblocking theory. Math. Program. Jørgen Tind, Laurence A. Wolsey
1981	J	`jnl`	An elementary survey of general duality theory in mathematical programming. Math. Program. Jørgen Tind, Laurence A. Wolsey
1981	J	`jnl`	Integer programming duality: Price functions and sensitivity analysis. Math. Program. Laurence A. Wolsey
1981	J	`jnl`	The b-hull of an integer program. Discret. Appl. Math. Laurence A. Wolsey
1980	J	`jnl`	A Canonical Representation of Simple Plant Location Problems and Its Applications. SIAM J. Algebraic Discret. Methods Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey
1980	J	`jnl`	Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. Oper. Res. Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey
1979	J	`jnl`	An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit. Oper. Res. Marshall L. Fisher, George L. Nemhauser, Laurence A. Wolsey
1978	J	`jnl`	An analysis of approximations for maximizing submodular set functions - I. Math. Program. George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher
1978	J	`jnl`	Best Algorithms for Approximating the Maximum of a Submodular Set Function. Math. Oper. Res. George L. Nemhauser, Laurence A. Wolsey
1977	J	`jnl`	Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting. J. Comb. Theory A Laurence A. Wolsey
1977	J	`jnl`	Valid Inequalities and Superadditivity for 0-1 Integer Programs. Math. Oper. Res. Laurence A. Wolsey
1976	J	`jnl`	Further facet generating procedures for vertex packing polytopes. Math. Program. Laurence A. Wolsey
1976	J	`jnl`	Technical Note - Facets and Strong Valid Inequalities for Integer Programs. Oper. Res. Laurence A. Wolsey
1975	J	`jnl`	Faces for a linear inequality in 0-1 variables. Math. Program. Laurence A. Wolsey
1974	J	`jnl`	A number theoretic reformulation and decomposition method for integer programming. Discret. Math. Laurence A. Wolsey
1974	J	`jnl`	Coefficient reduction for inequalities in 0-1 variables. Math. Program. Gordon H. Bradley, Peter L. Hammer, Laurence A. Wolsey
1973	J	`jnl`	Generalized dynamic programming methods in integer programming. Math. Program. Laurence A. Wolsey
1971	J	`jnl`	Group-Theoretic Results in Mixed Integer Programming. Oper. Res. Laurence A. Wolsey