Laurence A. Wolsey

According to our database1, Laurence A. Wolsey authored at least 130 papers between 1971 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The item dependent stockingcost constraint.
Constraints, 2019

2018
Single-Period Cutting Planes for Inventory Routing Problems.
Transportation Science, 2018

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons.
J. Comb. Optim., 2018

Convex hull results for the warehouse problem.
Discrete Optimization, 2018

2017
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds.
Math. Program., 2017

Tight MIP formulations for bounded up/down times and interval-dependent start-ups.
Math. Program., 2017

The Weighted Arborescence Constraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Continuous knapsack sets with divisible capacities.
Math. Program., 2016

The continuous knapsack set.
Math. Program., 2016

2015
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances.
Networks, 2015

Sufficiency of cut-generating functions.
Math. Program., 2015

Modeling Poset Convex Subsets.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Relaxations for two-level multi-item lot-sizing problems.
Math. Program., 2014

Covering Linear Programming with Violations.
INFORMS Journal on Computing, 2014

On the Practical Strength of Two-Row Tableau Cuts.
INFORMS Journal on Computing, 2014

The StockingCost Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2014

An efficient technique for solving the scheduling of appliances in smart-homes.
Proceedings of the American Control Conference, 2014

2013
A maritime inventory routing problem: Discrete time formulations and valid inequalities.
Networks, 2013

Strong and compact relaxations in the original space using a compact extended formulation.
EURO J. Computational Optimization, 2013

2012
On discrete lot-sizing and scheduling on identical parallel machines.
Optimization Letters, 2012

MIP formulations and heuristics for two-level production-transportation problems.
Computers & OR, 2012

2011
Mixing Sets Linked by Bidirected Paths.
SIAM Journal on Optimization, 2011

Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges.
SIAM J. Discrete Math., 2011

2010
Constrained Infinite Group Relaxations of MIPs.
SIAM Journal on Optimization, 2010

Lot-Sizing with Stock Upper Bounds and Fixed Charges.
SIAM J. Discrete Math., 2010

Uncapacitated two-level lot-sizing.
Oper. Res. Lett., 2010

Single item lot-sizing with non-decreasing capacities.
Math. Program., 2010

Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program., 2010

Two row mixed-integer cuts via lifting.
Math. Program., 2010

Lattice based extended formulations for integer linear equality systems.
Math. Program., 2010

Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs.
Math. Oper. Res., 2010

Optimizing production and transportation in a commit-to-delivery business mode.
European Journal of Operational Research, 2010

Composite lifting of group inequalities and an application to two-row mixing inequalities.
Discrete Optimization, 2010

Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times.
Computers & OR, 2010

Experiments with Two Row Tableau Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Reformulation and Decomposition of Integer Programs.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
Two "well-known" properties of subgradient optimization.
Math. Program., 2009

Multi-item lot-sizing with joint set-up costs.
Math. Program., 2009

Network Formulations of Mixed-Integer Programs.
Math. Oper. Res., 2009

2008
Mixed Integer Programming.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Lot-sizing on a tree.
Oper. Res. Lett., 2008

Compact formulations as a union of polyhedra.
Math. Program., 2008

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

The Mixing Set with Divisible Capacities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
The Mixing Set with Flows.
SIAM J. Discrete Math., 2007

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.
Annals OR, 2007

The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Inequalities from Two Rows of a Simplex Tableau.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Lot-sizing with production and delivery time windows.
Math. Program., 2006

Approximate extended formulations.
Math. Program., 2006

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.
Math. Program., 2006

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates.
INFORMS Journal on Computing, 2006

2004
Uncapacitated lot-sizing with buying, sales and backlogging.
Optimization Methods and Software, 2004

On unions and dominants of polytopes.
Math. Program., 2004

On the cut polyhedron.
Discrete Mathematics, 2004

Extended formulations for Gomory Corner polyhedra.
Discrete Optimization, 2004

Time for Old and New Faces.
Proceedings of the Sharpest Cut, 2004

2003
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem.
Networks, 2003

Strong formulations for mixed integer programs: valid inequalities and extended formulations.
Math. Program., 2003

Tight formulations for some simple mixed integer programs and convex objective integer programs.
Math. Program., 2003

Dynamic knapsack sets and capacitated lot-sizing.
Math. Program., 2003

The Aussois 2000 workshop in combinatorial optimization introduction.
Math. Program., 2003

Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems.
Operations Research, 2003

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.
4OR, 2003

2002
Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs.
Math. Oper. Res., 2002

Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation.
Management Science, 2002

Cutting planes in integer and mixed integer programming.
Discrete Applied Mathematics, 2002

Non-standard approaches to integer programming.
Discrete Applied Mathematics, 2002

A rendezvous point selection algorithm for videoconferencing applications.
Proceedings of the 2002 IEEE International Conference on Multimedia and Expo, 2002

2001
The uncapacitated lot-sizing problem with sales and safety stocks.
Math. Program., 2001

On the Wagner-Whitin Lot-Sizing Polyhedron.
Math. Oper. Res., 2001

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs.
Management Science, 2001

Aggregation and Mixed Integer Rounding to Solve MIPs.
Operations Research, 2001

Scheduling projects with labor constraints.
Discrete Applied Mathematics, 2001

1999
The 0-1 Knapsack problem with a single continuous variable.
Math. Program., 1999

bc - opt : a branch-and-cut code for mixed integer programs.
Math. Program., 1999

1998
The node capacitated graph partitioning problem: A computational study.
Math. Program., 1998

Cutting planes for integer programs with general integer variables.
Math. Program., 1998

Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms.
Operations Research, 1998

Optimal placement of add /drop multiplexers static and dynamic models.
European Journal of Operational Research, 1998

1997
Decomposition of Integer Programs and of Generating Sets.
Proceedings of the Algorithms, 1997

1996
An exact algorithm for IP column generation.
Oper. Res. Lett., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996

1995
Optimizing constrained subtrees of trees.
Math. Program., 1995

Capacitated Facility Location: Valid Inequalities and Facets.
Math. Oper. Res., 1995

Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation.
Discrete Applied Mathematics, 1995

1994
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs.
SIAM J. Discrete Math., 1994

Polyhedra for lot-sizing with Wagner-Whitin costs.
Math. Program., 1994

Modelling piecewise linear concave costs in a tree partitioning problem.
Discrete Applied Mathematics, 1994

1993
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities.
Math. Oper. Res., 1993

Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

Algorithms and reformulations for lot sizing problems.
Proceedings of the Combinatorial Optimization, 1993

1992
Lot-sizing polyhedra with a cardinality constraint.
Oper. Res. Lett., 1992

A time indexed formulation of non-preemptive single machine scheduling problems.
Math. Program., 1992

Book review.
ZOR - Meth. & Mod. of OR, 1992

Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
Finding minimum cost directed trees with demands and capacities.
Annals OR, 1991

1990
A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs.
Math. Program., 1990

Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints.
Discrete Applied Mathematics, 1990

Formulating the single machine sequencing problem with release dates as a mixed integer program.
Discrete Applied Mathematics, 1990

1989
Strong formulations for mixed integer programming: A survey.
Math. Program., 1989

Uncapacitated Lot-Sizing Problems with Start-Up Costs.
Operations Research, 1989

1988
Lot-size models with backlogging: Strong reformulations and cutting planes.
Math. Program., 1988

Integer and Combinatorial Optimization.
Wiley interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-1-118-62737-2, 1988

1987
Solving Mixed Integer Programming Problems Using Automatic Reformulation.
Operations Research, 1987

1986
Valid inequalities for mixed 0-1 programs.
Discrete Applied Mathematics, 1986

Packing and covering a tree by subtrees.
Combinatorica, 1986

1985
Sensitivity Analysis for Branch and Bound Integer Programming.
Operations Research, 1985

Valid Linear Inequalities for Fixed Charge Problems.
Operations Research, 1985

1984
Fractional covers for forests and matchings.
Math. Program., 1984

1982
On the use of penumbras in blocking and antiblocking theory.
Math. Program., 1982

Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems.
Math. Oper. Res., 1982

An analysis of the greedy algorithm for the submodular set covering problem.
Combinatorica, 1982

1981
Integer programming duality: Price functions and sensitivity analysis.
Math. Program., 1981

An elementary survey of general duality theory in mathematical programming.
Math. Program., 1981

The b-hull of an integer program.
Discrete Applied Mathematics, 1981

1980
A Canonical Representation of Simple Plant Location Problems and Its Applications.
SIAM J. Matrix Analysis Applications, 1980

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.
Operations Research, 1980

1979
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit.
Operations Research, 1979

1978
An analysis of approximations for maximizing submodular set functions - I.
Math. Program., 1978

Best Algorithms for Approximating the Maximum of a Submodular Set Function.
Math. Oper. Res., 1978

1977
Valid Inequalities and Superadditivity for 0-1 Integer Programs.
Math. Oper. Res., 1977

Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting.
J. Comb. Theory, Ser. A, 1977

1976
Further facet generating procedures for vertex packing polytopes.
Math. Program., 1976

Technical Note - Facets and Strong Valid Inequalities for Integer Programs.
Operations Research, 1976

1975
Faces for a linear inequality in 0-1 variables.
Math. Program., 1975

1974
Coefficient reduction for inequalities in 0-1 variables.
Math. Program., 1974

A number theoretic reformulation and decomposition method for integer programming.
Discrete Mathematics, 1974

1973
Generalized dynamic programming methods in integer programming.
Math. Program., 1973

1971
Group-Theoretic Results in Mixed Integer Programming.
Operations Research, 1971


  Loading...