Savelsbergh Martin W.P.

Martin W.P. Savelsbergh

Information about the author Martin W.P. Savelsbergh will soon be added to the site.
Found 27 papers in total
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
2008
We consider the resource-constrained scheduling problem when each job's resource...
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
2007
We analyze an on-line algorithm (dispatch policy) for a dynamic multi-period routing...
Analysis of bounds for a capacitated single-item lot-sizing problem
Analysis of bounds for a capacitated single-item lot-sizing problem
2007
Lot-sizing problems are cornerstone optimization problems for production planning with...
Shipper collaboration
Shipper collaboration
2007
The interest in collaborative logistics is fuelled by the ever increasing pressure on...
Inventory routing with continuous moves
Inventory routing with continuous moves
2007
The typical inventory routing problem deals with the repeated distribution of a single...
Worst-case analysis for split delivery vehicle routing problems
Worst-case analysis for split delivery vehicle routing problems
2006
In the vehicle routing problem (VRP) the objective is to construct a minimum cost set...
Global intermodal tank container management for the chemical industry
Global intermodal tank container management for the chemical industry
2005
The scale of the global chemical industry is enormous: in 2003, the total value of...
An experimental study of LP-based approximation algorithms for scheduling problems
An experimental study of LP-based approximation algorithms for scheduling problems
2005
Recently there has been much progress on the design of approximation algorithms for a...
A generic view of Dantzig–Wolfe decomposition in mixed integer programming
A generic view of Dantzig–Wolfe decomposition in mixed integer programming
2006
The Dantzig–Wolfe reformulation principle is presented based on the concept of...
Decision support for consumer direct grocery initiatives
Decision support for consumer direct grocery initiatives
2005
Many companies with consumer direct service models, especially grocery delivery...
Integer-programming software systems
Integer-programming software systems
2005
Recent developments in integer-programming software systems have tremendously improved...
Minimum vehicle fleet size under time-window constraints at a container terminal
Minimum vehicle fleet size under time-window constraints at a container terminal
2005
Products can be transported in containers from one port to another. At a container...
A decomposition approach for the inventory-routing problem
A decomposition approach for the inventory-routing problem
2004
In this paper, we present a solution approach for the inventory-routing problem. The...
Delivery volume optimization
Delivery volume optimization
2004
This work is motivated by the need to solve the inventory routing problem when...
Dynamic programming approximations for a stochastic inventory routing problem
Dynamic programming approximations for a stochastic inventory routing problem
2004
This work is motivated by the need to solve the inventory routing problem when...
A parallel, linear programming-based heuristic for large-scale set partitioning problems
A parallel, linear programming-based heuristic for large-scale set partitioning problems
2001
We describe a parallel, linear programming and implication-based heuristic for solving...
An integer programming heuristic for component allocation in printed circuit card assembly systems
An integer programming heuristic for component allocation in printed circuit card assembly systems
2001
Component allocation is an important element of process planning for printed circuit...
A parallel, linear programming-based heuristic for large-scale set partitioning problems
A parallel, linear programming-based heuristic for large-scale set partitioning problems
2001
We describe a parallel, linear programming and implication-based heuristic for solving...
A relational modeling system for linear and integer programming
A relational modeling system for linear and integer programming
2000
We discuss an integer linear programming modeling system based on relational algebra....
Progress in linear programming-based algorithms for integer programming: An exposition
Progress in linear programming-based algorithms for integer programming: An exposition
2000
This paper is about modeling and solving mixed integer programming problems. In the...
Time-indexed formulations for machine scheduling problems: Column generation
Time-indexed formulations for machine scheduling problems: Column generation
2000
Time-indexed formulations for machine scheduling problems have received a great deal...
On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
2000
We consider the single item capacitated lot-sizing problem, a well-known production...
Conflict graphs in solving integer programming problems
Conflict graphs in solving integer programming problems
2000
We report on the use of conflict graphs in solving integer programs. A conflict graph...
Lifted cover inequalities for 0–1 integer programs: Complexity
Lifted cover inequalities for 0–1 integer programs: Complexity
1999
We investigate several complexity issues related to branch-and-cut algorithms for...
Papers per page: