Wolsey Laurence A.

Laurence A. Wolsey

Information about the author Laurence A. Wolsey will soon be added to the site.
Found 31 papers in total
Lot-sizing on a tree
Lot-sizing on a tree
2008
For the problem of lot-sizing on a tree with constant capacities, or stochastic...
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
2007
In this survey we attempt to give a unified presentation of a variety of results on...
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
2006
We consider both branch-and-cut and column-generation approaches for the problem of...
Tight mixed-integer programming formulations for multi-item discrete lot-sizing problems
Tight mixed-integer programming formulations for multi-item discrete lot-sizing problems
2003
This paper discusses mixed-integer programming formulations of variants of the...
Capacitated facility location – valid inequalities and facets
Capacitated facility location – valid inequalities and facets
1995
We examine the polyhedral structure of the convex hull of feasible solutions of the...
Strong formulations for mixed integer programs: valid inequalities and extended formulations
Strong formulations for mixed integer programs: valid inequalities and extended formulations
2003
We examine progress over the last fifteen years in finding strong valid inequalities...
Combining problem structure with basis reduction to solve a class of hard integer programs
Combining problem structure with basis reduction to solve a class of hard integer programs
2002
Recently Aardal et al . have successfully solved some small, difficult,...
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
2003
We present a branch-and-cut algorithm to solve the single-commodity, uncapacitated,...
Modelling practical lot-sizing problems as mixed-integer programs
Modelling practical lot-sizing problems as mixed-integer programs
2001
In spite of the remarkable improvements in the quality of general purpose...
Solving multi-item lot-sizing problems with a mixed integer programming solver using classification and reformulation
Solving multi-item lot-sizing problems with a mixed integer programming solver using classification and reformulation
2002
Based on research on the polyhedral structure of lot-sizing models over the last 20...
Aggregation and mixed integer rounding to solve mixed integer programs
Aggregation and mixed integer rounding to solve mixed integer programs
2001
In this paper, we discuss the use of mixed integer rounding (MIR) inequalities to...
bc – prod: A specialized branch-and-cut system for lot-sizing problems
bc – prod: A specialized branch-and-cut system for lot-sizing problems
2000
bc – prod is a prototype modelling and optimization system designed and able to...
bc-opt: A branch-and-cut code for mixed integer programs
bc-opt: A branch-and-cut code for mixed integer programs
1999
A branch-and-cut mixed integer programming system, called bc-opt, is described,...
Optimal placement of add/drop multiplexers: Static and dynamic models
Optimal placement of add/drop multiplexers: Static and dynamic models
1998
We study further a problem that has arisen recently in the design of...
Cutting planes for integer programs with general integer variables
Cutting planes for integer programs with general integer variables
1998
We investigate the use of cutting planes for integer programs with general integer...
The node capacitated graph partitioning problem: A computational study
The node capacitated graph partitioning problem: A computational study
1998
In this paper we consider the problem of k -partitioning the nodes of a graph with...
Mixed integer programming (MIP) modelling of changeovers in production planning and scheduling problems
Mixed integer programming (MIP) modelling of changeovers in production planning and scheduling problems
1997
The goal here is to survey some recent and not so recent work that can be used to...
Progress with single-item lot-sizing
Progress with single-item lot-sizing
1995
The goal in this paper is to look at the history of the single-item uncapacitated...
Formulations and valid inequalities for the node capacitated graph partitioning problem
Formulations and valid inequalities for the node capacitated graph partitioning problem
1996
We investigate the problem of partitioning the nodes of a graph under capacity...
An exact algorithm for IP column generation
An exact algorithm for IP column generation
1996
An exact column generation algorithm for integer programs with a large (implicit)...
Optimizing constrained subtrees of trees
Optimizing constrained subtrees of trees
1995
Given a tree G=(V,E) and a weight function defined on subsets of its nodes, the...
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
1993
Multicommodity extended formulations of single source uncapacitated fixed charge...
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
1995
Three regions arising as surrogates in certain network design problems are the...
Polyhedra for lot-sizing with Wagner-Whitin costs
Polyhedra for lot-sizing with Wagner-Whitin costs
1994
The authors examine the single-item lot-sizing problem with Wagner-Whitin costs over...
Papers per page: