L. Wolsey

发表

Integer Programming

G. Nemhauser, L. Wolsey, 2020 .

Wiley‐Interscience Series in Discrete Mathematics and Optimization

G. Nemhauser, L. Wolsey, 2014 .

Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms*

G. Nemhauser, L. Wolsey, 1981 .

Integer and Combinatorial Optimization

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 1988 .

An analysis of approximations for maximizing submodular set functions—I

M. L. Fisher, G. L. Nemhauser, L. A. Wolsey, 1978, Math. Program..

Heuristic analysis, linear programming and branch and bound

L. Wolsey, 1980 .

Valid Linear Inequalities for Fixed Charge Problems

Laurence A. Wolsey, Manfred W. Padberg, Tony J. Van Roy, 1985, Oper. Res..

Technical Note - Facets and Strong Valid Inequalities for Integer Programs

Laurence A. Wolsey, L. Wolsey, 1976, Oper. Res..

Solving mixed integer programs y automatic reformulation

L. Wolsey, T. V. Roy, 1984 .

Extensions of the Group Theoretic Approach in Integer Programming

L. Wolsey, 1971 .

Cutting Planes form Two Rows of a Simplex Tableau

L. Wolsey, K. Andersen, Q. Louveaux, 2007 .

On the greedy heuristic for continuous covering and packing problems

L. Wolsey, M. Fisher, 1982 .

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

Laurence A. Wolsey, Pascal Van Hentenryck, L. Wolsey, 2007, CPAIOR.

A new approach to minimising the frontwidth in finite element calculations

L. Wolsey, R. Keunings, C. D. Souza, 1994 .

Economic lot-sizing with start-up costs: the convex hull.

C.P.M. van Hoesel, L. Wolsey, A. Wagelmans, 1991 .

Two “well-known” properties of subgradient optimization

Laurence A. Wolsey, Kurt M. Anstreicher, L. Wolsey, 2009, Math. Program..

Integer and Combinatorial Optimization

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 1988, Wiley interscience series in discrete mathematics and optimization.

Chapter 9 Optimal trees

L. Wolsey, T. Magnanti, 1995 .

MIP modelling of changeovers in production planning and scheduling problems

Laurence A. Wolsey, L. Wolsey, 1997 .

Chapter VI Integer programming

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 1989 .

Valid inequalities and separation for uncapacitated fixed charge networks

L. Wolsey, T. V. Roy, 1985 .

Economic Decision Making : Games, Econometrics and Optimisation : Contributions in Honour of Jacques H. Drèze

L. Wolsey, J. Gabszewicz, J. Richard, 1992 .

Global Constraint for the Set Covering Problem

L. Wolsey, P. Schaus, Promoteur Yves Deville, 2007 .

Trees and Cuts

Laurence A. Wolsey, Manfred W. Padberg, M. Padberg, 1983 .

Submodularity and valid inequalities in capacitated fixed charge networks

Laurence A. Wolsey, L. Wolsey, 1989 .

Single Item Lot-Sizing with Non-Decreasing Capacities

Yves Pochet, L. Wolsey, Yves Pochet, 2007 .

Designing Private Line Networks - Polyhedral Analysis and Computation

L. Wolsey, B. Brockmüller, Oktay Günlück, 1996 .

Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

Laurence A. Wolsey, Ronald L. Rardin, L. Wolsey, 1993 .

Modelling piecewise linear concave costs in a tree partitioning problem

Laurence A. Wolsey, El Houssaine Aghezzaf, L. Wolsey, 1994, Discret. Appl. Math..

Discrete Lot-Sizing and Scheduling on Identical Parallel Machines C .

L. Wolsey, M. Minoux, C. Gicquel, 2019 .

Cutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms

R. Gomory, G. Nemhauser, L. Wolsey, 1998 .

Sufficiency of cut-generating functions

Laurence A. Wolsey, Gérard Cornuéjols, Sercan Yildiz, 2015, Math. Program..

LATTICE REFORMULATIONS CUTS

L. Wolsey, K. Aardal, A. Lodi, 2018 .

Cutting planes from two rows of the simplex tableau (extended version)

Laurence A. Wolsey, Kent Andersen, Robert Weismantel, 2006 .

Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 2006 .

2 The Mixed Integer Rounding and Gomory Mixed Integer Inequalities

L. Wolsey, H. Marchand, 1998 .

Facets and Strong Valid Inequalities for

L. Wolsey, 2016 .

Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations

Laurence A. Wolsey, Denis Vanderstraeten, R. Keunings, 1993, PPSC.

Formulating Single Machine Scheduling Problems With Precedence Constraints

L. Wolsey, L. Wolsey, 1989 .

Tight MIP formulations for bounded up/down times and interval-dependent start-ups

L. Wolsey, M. Queyranne, 2016, Mathematical programming.

“Facet” separation with one linear program

L. Wolsey, M. Conforti, 2018, Mathematical Programming.

A rendezvous point selection algorithm for videoconferencing applications

Laurence A. Wolsey, Jean-François Macq, Benoit M. Macq, 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

The nucleolus and kernel for simple games or special valid inequalities for 0–1 linear integer programs

Laurence Wolsey, L. Wolsey, 1976 .

Coefficient reduction for inequalities in 0–1 variables

Laurence A. Wolsey, Peter L. Hammer, Gordon H. Bradley, 1974, Math. Program..

An analysis of the greedy algorithm for the submodular set covering problem

Laurence A. Wolsey, L. Wolsey, 1982, Comb..

Uncapacitated lot-sizing: The convex hull of solutions

Laurence A. Wolsey, Imre Bárány, Tony J. Van Roy, 1984 .

A maritime inventory routing problem: Discrete time formulations and valid inequalities

Laurence A. Wolsey, Marielle Christiansen, Henrik Andersson, 2013, Networks.

Approximate extended formulations

Laurence A. Wolsey, Mathieu Van Vyve, L. Wolsey, 2006, Math. Program..

Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries

Marielle Christiansen, Agostinho Agra, Laurence Wolsey, 2021, Eur. J. Oper. Res..

Best Algorithms for Approximating the Maximum of a Submodular Set Function

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 1978, Math. Oper. Res..

Strong Formulations for Multi-Item Capacitated Lot Sizing

Laurence A. Wolsey, Imre Bárány, Tony J. Van Roy, 1984 .

The node capacitated graph partitioning problem: A computational study

Laurence A. Wolsey, Carlos Eduardo Ferreira, Cid C. de Souza, 1998, Math. Program..

A time indexed formulation of non-preemptive single machine scheduling problems

Laurence A. Wolsey, Jorge P. Sousa, L. Wolsey, 1992, Math. Program..

Formulations and valid inequalities for the node capacitated graph partitioning problem

Laurence A. Wolsey, Carlos Eduardo Ferreira, Cid C. de Souza, 1996, Math. Program..

Reformulation and Decomposition of Integer Programs

Laurence A. Wolsey, François Vanderbeck, L. Wolsey, 2009, 50 Years of Integer Programming.

On the Practical Strength of Two-Row Tableau Cuts

Laurence A. Wolsey, Andrea Lodi, Santanu S. Dey, 2014, INFORMS J. Comput..

Constrained Infinite Group Relaxations of MIPs

Laurence A. Wolsey, Santanu S. Dey, L. Wolsey, 2010, SIAM J. Optim..

Two row mixed-integer cuts via lifting

Laurence A. Wolsey, Santanu S. Dey, L. Wolsey, 2010, Math. Program..

Experiments with Two Row Tableau Cuts

Laurence A. Wolsey, Andrea Lodi, Santanu S. Dey, 2010, IPCO.

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles

Laurence A. Wolsey, Santanu S. Dey, L. Wolsey, 2008, IPCO.

Inequalities from Two Rows of a Simplex Tableau

Laurence A. Wolsey, Kent Andersen, Robert Weismantel, 2007, IPCO.

A recursive procedure to generate all cuts for 0–1 mixed integer programs

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 1990, Math. Program..

Aggregation and Mixed Integer Rounding to Solve MIPs

Laurence A. Wolsey, Hugues Marchand, L. Wolsey, 2001, Oper. Res..

Lot-Sizing on a Tree

Laurence A. Wolsey, Marco Di Summa, L. Wolsey, 2006, Oper. Res. Lett..

On discrete lot-sizing and scheduling on identical parallel machines

Laurence A. Wolsey, Michel Minoux, Céline Gicquel, 2012, Optim. Lett..

Dynamic knapsack sets and capacitated lot-sizing

Laurence A. Wolsey, Hugues Marchand, Marko Loparic, 2003, Math. Program..

Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

Laurence A. Wolsey, L. Wolsey, 2002, Manag. Sci..

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

Laurence A. Wolsey, Gaetan Belvaux, L. Wolsey, 2001, Manag. Sci..

bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

Laurence A. Wolsey, Gaetan Belvaux, L. Wolsey, 2000 .

Progress With Single-item Lot-sizing

Laurence A. Wolsey, L. Wolsey, 1995 .

Polyhedra for lot-sizing with Wagner—Whitin costs

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 1994, Math. Program..

Algorithms and reformulations for lot sizing problems

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 1994, Combinatorial Optimization.

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 1993, Math. Oper. Res..

Valid Inequalities for the Lasdon-Terjung Production Model

Laurence A. Wolsey, L. Wolsey, FranÃ§ois Vanderbeck, 1992 .

Multi-item lot-sizing problems using strong cutting planes

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 1991 .

Uncapacitated Lot-Sizing Problems with Start-Up Costs

Laurence A. Wolsey, L. Wolsey, 1989, Oper. Res..

Lot-size models with backlogging: Strong reformulations and cutting planes

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 1988, Math. Program..

Production Planning by Mixed Integer Programming

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 2010 .

Optimizing production and transportation in a commit-to-delivery business mode

Rafael A. Melo, L. Wolsey, 2010, Eur. J. Oper. Res..

Non-standard approaches to integer programming

Laurence A. Wolsey, Karen Aardal, Robert Weismantel, 2002, Discret. Appl. Math..

Mixed Integer Programming

Laurence A. Wolsey, L. Wolsey, 2008, Wiley Encyclopedia of Computer Science and Engineering.

Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms

Laurence A. Wolsey, François Vanderbeck, Alain S. Sutter, 1998, Oper. Res..

The 0-1 Knapsack problem with a single continuous variable

Laurence A. Wolsey, Hugues Marchand, L. Wolsey, 1999, Math. Program..

The b-hull of an integer program

Laurence A. Wolsey, L. Wolsey, 1981, Discret. Appl. Math..

Generalized dynamic programming methods in integer programming

Laurence A. Wolsey, L. Wolsey, 1973, Math. Program..

An elementary survey of general duality theory in mathematical programming

Laurence A. Wolsey, Jørgen Tind, L. Wolsey, 1981, Math. Program..

Cutting planes in integer and mixed integer programming

Laurence A. Wolsey, Hugues Marchand, Alexander Martin, 2002, Discret. Appl. Math..

Further facet generating procedures for vertex packing polytopes

L. A. Wolsey, L. Wolsey, 1976, Math. Program..

Faces for a linear inequality in 0–1 variables

Laurence A. Wolsey, L. Wolsey, 1975, Math. Program..

Covering Linear Programming with Violations

Laurence A. Wolsey, Feng Qiu, Shabbir Ahmed, 2014, INFORMS J. Comput..

Modeling Poset Convex Subsets

Laurence A. Wolsey, Maurice Queyranne, L. Wolsey, 2015, CTW.

Composite lifting of group inequalities and an application to two-row mixing inequalities

Laurence A. Wolsey, Santanu S. Dey, L. Wolsey, 2010, Discret. Optim..

Single item lot-sizing with non-decreasing capacities

Laurence A. Wolsey, Yves Pochet, L. Wolsey, 2007, Math. Program..

Ls-Lib: A Library of Reformulations, Cut Separation Algorithms and Primal Heuristics in a High-Level Modeling Language for Solving MIP Production Planning Problems

Yves Pochet, L. Wolsey, Yves Pochet, 2005 .

Strong formulations for mixed integer programming: A survey

Laurence Wolsey, L. Wolsey, 1989, Math. Program..

2 Valid Inequalities for Dynamic Knapsack Sets

L. Wolsey, 2000 .

bc–opt: a branch-and-cut code for mixed integer programs

Laurence A. Wolsey, Cécile Cordier, Hugues Marchand, 1999, Math. Program..

Solving Mixed Integer Programming Problems Using Automatic Reformulation

Laurence A. Wolsey, Tony J. Van Roy, L. Wolsey, 1987, Oper. Res..

An exact algorithm for IP column generation

Laurence A. Wolsey, François Vanderbeck, L. Wolsey, 1994, Oper. Res. Lett..

Convex hull results for the warehouse problem

Laurence A. Wolsey, Hande Yaman, L. Wolsey, 2018, Discret. Optim..

Strong formulations for mixed integer programs: valid inequalities and extended formulations

Laurence A. Wolsey, L. Wolsey, 2003, Math. Program..

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem

Laurence A. Wolsey, George L. Nemhauser, Gérard Cornuéjols, 1980, Oper. Res..

MIP formulations and heuristics for two-level production-transportation problems

Laurence A. Wolsey, Rafael A. Melo, L. Wolsey, 2012, Comput. Oper. Res..

Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems

L. Wolsey, 1982, Math. Oper. Res..

Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting

Laurence A. Wolsey, L. Wolsey, 1977, J. Comb. Theory, Ser. A.

Special‐Purpose Algorithms

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 2014 .

“Facet” separation with one linear program

Laurence A. Wolsey, Michele Conforti, L. Wolsey, 2019, Math. Program..

Mixing Sets Linked by Bidirected Paths

Laurence A. Wolsey, Marco Di Summa, L. Wolsey, 2011, SIAM J. Optim..

Integer programming duality: Price functions and sensitivity analysis

Laurence A. Wolsey, L. Wolsey, 1981, Math. Program..

Valid inequalities for mixed 0-1 programs

Laurence A. Wolsey, T. J. Van Roy, L. Wolsey, 1986, Discret. Appl. Math..

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

Laurence A. Wolsey, George L. Nemhauser, Marshall L. Fisher, 1979, Oper. Res..

Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates

Laurence A. Wolsey, Ruslan Sadykov, L. Wolsey, 2003, INFORMS J. Comput..

Formulating the single machine sequencing problem with release dates as a mixed integer program

Martin E. Dyer, Laurence A. Wolsey, L. Wolsey, 1990, Discret. Appl. Math..

An efficient technique for solving the scheduling of appliances in smart-homes

Laurence A. Wolsey, Raphaël M. Jungers, Julien M. Hendrickx, 2014, 2014 American Control Conference.

Scheduling projects with labor constraints

Laurence A. Wolsey, Y. Wang, Cid C. de Souza, 2001, Discret. Appl. Math..

50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art

M. Jünger, G. Rinaldi, G. Nemhauser, 2010 .

Lot-Sizing with Stock Upper Bounds and Fixed Charges

Laurence A. Wolsey, Marco Di Summa, L. Wolsey, 2010, SIAM J. Discret. Math..

Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing

L. Wolsey, Dieter Weninger, 2023, Eur. J. Oper. Res..

The StockingCost Constraint

Laurence A. Wolsey, Yves Deville, Pierre Schaus, 2014, CP.

Lot-sizing with production and delivery time windows

Laurence A. Wolsey, L. Wolsey, 2005, Math. Program..

The uncapacitated lot-sizing problem with sales and safety stocks

Laurence A. Wolsey, Yves Pochet, Marko Loparic, 2001, Math. Program..

Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs

Laurence A. Wolsey, Michele Conforti, Giacomo Zambelli, 2010, Math. Oper. Res..

Lattice based extended formulations for integer linear equality systems

L. Wolsey, K. Aardal, 2007, Math. Program..

Network Formulations of Mixed-Integer Programs

Laurence A. Wolsey, Friedrich Eisenbrand, Marco Di Summa, 2006, Math. Oper. Res..

Compact formulations as a union of polyhedra

Laurence A. Wolsey, Michele Conforti, L. Wolsey, 2005, Math. Program..

Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs

Laurence A. Wolsey, Quentin Louveaux, L. Wolsey, 2002, Math. Oper. Res..

Packing and covering a tree by subtrees

Laurence A. Wolsey, Jack Edmonds, Imre Bárány, 1986, Comb..

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

Laurence A. Wolsey, Quentin Louveaux, L. Wolsey, 2007, Ann. Oper. Res..

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

Laurence A. Wolsey, Quentin Louveaux, L. Wolsey, 2003, 4OR.

Graphs and Networks

Laurence A. Wolsey, George L. Nemhauser, G. Nemhauser, 2014 .

Lifting group inequalities and an application to mixing inequalities

Laurence A. Wolsey, Santanu S. Dey, L. Wolsey, 2009 .

Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances

Laurence A. Wolsey, Pasquale Avella, Maurizio Boccia, 2015, Networks.

Single-Period Cutting Planes for Inventory Routing Problems

Laurence A. Wolsey, Pasquale Avella, Maurizio Boccia, 2017, Transp. Sci..

Integer Programming

G. Nemhauser, L. Wolsey, 1972 .

Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems

Laurence A. Wolsey, Andrew J. Miller, L. Wolsey, 2003, Oper. Res..

Tight MIP formulations for bounded up/down times and interval-dependent start-ups

Laurence A. Wolsey, Maurice Queyranne, L. Wolsey, 2017, Math. Program..

On unions and dominants of polytopes

Egon Balas, Laurence A. Wolsey, Alexander Bockmayr, 2004, Math. Program..

Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints

Laurence A. Wolsey, L. Wolsey, 1990, Discret. Appl. Math..

Capacitated Facility Location: Valid Inequalities and Facets

Laurence A. Wolsey, Karen Aardal, Yves Pochet, 1995, Math. Oper. Res..

Valid Inequalities and Superadditivity for 0-1 Integer Programs

Laurence A. Wolsey, L. Wolsey, 1977, Math. Oper. Res..