Savelsbergh M.W.P.

M.W.P. Savelsbergh

Information about the author M.W.P. Savelsbergh will soon be added to the site.
Found 16 papers in total
On the polyhedral structure of a multi-item production model with setup times
On the polyhedral structure of a multi-item production model with setup times
2003
We present and study a mixed integer programming model that arises as a substructure...
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
2003
We study a special case of a structured mixed integer programming model that arises in...
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
2002
The relation of time indexed formulations of nonpreemptive single machine scheduling...
Polyhedral results for the edge capacity polytope
Polyhedral results for the edge capacity polytope
2002
Network loading problems occur in the design of telecommunication networks, in many...
Valid inequalities for problems with additive variable upper bounds
Valid inequalities for problems with additive variable upper bounds
2001
We study the facial structure of a polyhedron associated with the single node...
A branch and cut approach to the cardinality constrained circuit problem
A branch and cut approach to the cardinality constrained circuit problem
2002
The Cardinality Constrained Circuit Problem (CCCP) is the problem of finding a minimum...
The stochastic inventory routing problem with direct deliveries
The stochastic inventory routing problem with direct deliveries
2002
Vendor managed inventory replenishment is a business practice in which vendors monitor...
The mixed vertex packing problem
The mixed vertex packing problem
2000
We study a generalization of the vertex packing problem having both binary and bounded...
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
1995
Given a finite ground set, a set of subsets, and costs on the subsets, the set...
A computational study of search strategies for mixed integer programming
A computational study of search strategies for mixed integer programming
1999
The branch-and-bound procedure for solving mixed integer programming (MIP) problems...
Lifted flow cover inequalities for mixed 0–1 integer programs
Lifted flow cover inequalities for mixed 0–1 integer programs
1999
We investigate strong inequalities for mixed 0–1 integer programs derived from...
A polyhedral approach to single-machine scheduling problems
A polyhedral approach to single-machine scheduling problems
1999
We report new results for a time-indexed formulation of nonpreemptive single-machine...
Preprocessing and probing techniques for mixed integer programming problems
Preprocessing and probing techniques for mixed integer programming problems
1994
In the first part of the paper, we present a framework for describing basic techniques...
An efficient implementation of local search algorithms for constrained routing problems
An efficient implementation of local search algorithms for constrained routing problems
1990
The paper investigates the implementation of local search algorithms for routing...
A classification scheme for vehicle routing and scheduling problems
A classification scheme for vehicle routing and scheduling problems
1990
A classification scheme is proposed for a class of models that arise in the area of...
Behind the screen: DSS from an Operational Research OR point of view
Behind the screen: DSS from an Operational Research OR point of view
1988
Interactive planning systems are a relatively new phenomenon in the practice of...
Papers per page: