| 2009 |
|---|
| 29 | EE | Martin W. P. Savelsbergh:
Branch and Price: Integer Programming with Column Generation.
Encyclopedia of Optimization 2009: 328-332 |
| 2008 |
|---|
| 28 | EE | Alan Erera,
Burak Karacik,
Martin W. P. Savelsbergh:
A dynamic driver management scheme for less-than-truckload carriers.
Computers & OR 35(11): 3397-3411 (2008) |
| 27 | EE | Martin W. P. Savelsbergh,
Jin-Hwa Song:
An optimization algorithm for the inventory routing problem with continuous moves.
Computers & OR 35(7): 2266-2282 (2008) |
| 26 | EE | Jill R. Hardin,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements.
Discrete Optimization 5(1): 19-35 (2008) |
| 2007 |
|---|
| 25 | EE | Özlem Ergun,
Gültekin Kuyzu,
Martin W. P. Savelsbergh:
Shipper collaboration.
Computers & OR 34(6): 1551-1560 (2007) |
| 24 | EE | Jill R. Hardin,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Analysis of bounds for a capacitated single-item lot-sizing problem.
Computers & OR 34(6): 1721-1743 (2007) |
| 23 | EE | Martin W. P. Savelsbergh,
Jin-Hwa Song:
Inventory routing with continuous moves.
Computers & OR 34(6): 1744-1763 (2007) |
| 22 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Martin W. P. Savelsbergh:
Competitive analysis for dynamic multiperiod uncapacitated routing problems.
Networks 49(4): 308-317 (2007) |
| 21 | EE | Enrico Angelelli,
Martin W. P. Savelsbergh,
Maria Grazia Speranza:
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem.
Oper. Res. Lett. 35(6): 713-721 (2007) |
| 2006 |
|---|
| 20 | EE | François Vanderbeck,
Martin W. P. Savelsbergh:
A generic view of Dantzig-Wolfe decomposition in mixed integer programming.
Oper. Res. Lett. 34(3): 296-306 (2006) |
| 2005 |
|---|
| 19 | EE | Alper Atamtürk,
Martin W. P. Savelsbergh:
Integer-Programming Software Systems.
Annals OR 140(1): 67-124 (2005) |
| 18 | EE | Martin W. P. Savelsbergh,
R. N. Uma,
Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
INFORMS Journal on Computing 17(1): 123-136 (2005) |
| 2003 |
|---|
| 17 | EE | Stan P. M. van Hoesel,
Arie M. C. A. Koster,
Robert L. M. J. van de Leensel,
Martin W. P. Savelsbergh:
Bidirected and unidirected capacity installation in telecommunication networks.
Discrete Applied Mathematics 133(1-3): 103-121 (2003) |
| 16 | EE | Andrew J. Miller,
George L. Nemhauser,
Martin W. P. Savelsbergh:
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case.
Math. Program. 95(1): 71-90 (2003) |
| 15 | EE | Brady Hunsaker,
Anton J. Kleywegt,
Martin W. P. Savelsbergh,
Craig A. Tovey:
Optimal Online Algorithms for Minimax Resource Scheduling.
SIAM J. Discrete Math. 16(4): 555-590 (2003) |
| 2002 |
|---|
| 14 | EE | Brady Hunsaker,
Martin W. P. Savelsbergh:
Efficient feasibility testing for dial-a-ride problems.
Oper. Res. Lett. 30(3): 169-173 (2002) |
| 2001 |
|---|
| 13 | EE | Andrew J. Miller,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.
IPCO 2001: 318-332 |
| 12 | | Cristina C. B. Cavalcante,
C. Carvalho de Souza,
Martin W. P. Savelsbergh,
Y. Wang,
Laurence A. Wolsey:
Scheduling projects with labor constraints.
Discrete Applied Mathematics 112(1-3): 27-52 (2001) |
| 11 | EE | Jeff T. Linderoth,
Eva K. Lee,
Martin W. P. Savelsbergh:
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems.
INFORMS Journal on Computing 13(3): 191-209 (2001) |
| 10 | | Gail W. DePuy,
Martin W. P. Savelsbergh,
Jane C. Ammons,
Leon F. McGinnis:
An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems.
J. Heuristics 7(4): 351-369 (2001) |
| 2000 |
|---|
| 9 | EE | Ellis L. Johnson,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition.
INFORMS Journal on Computing 12(1): 2-23 (2000) |
| 8 | EE | Marjan van den Akker,
Cor A. J. Hurkens,
Martin W. P. Savelsbergh:
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation.
INFORMS Journal on Computing 12(2): 111-124 (2000) |
| 7 | | Zonghao Gu,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Sequence Independent Lifting in Mixed Integer Programming.
J. Comb. Optim. 4(1): 109-129 (2000) |
| 1999 |
|---|
| 6 | EE | Alper Atamtürk,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Valid Inequalities for Problems with Additive Variable Upper Bounds.
IPCO 1999: 60-72 |
| 5 | EE | Anton J. Kleywegt,
Vijay S. Nori,
Martin W. P. Savelsbergh,
Craig A. Tovey:
Online Resource Minimization.
SODA 1999: 576-585 |
| 1998 |
|---|
| 4 | | Martin W. P. Savelsbergh,
R. N. Uma,
Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
SODA 1998: 453-462 |
| 1995 |
|---|
| 3 | | Zonghao Gu,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Sequence Independent Lifting of Cover Inequalities.
IPCO 1995: 452-461 |
| 1993 |
|---|
| 2 | EE | Gerard A. P. Kindervater,
Jan Karel Lenstra,
Martin W. P. Savelsbergh:
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.
Discrete Applied Mathematics 42(2): 211-225 (1993) |
| 1985 |
|---|
| 1 | EE | Martin W. P. Savelsbergh,
Ton Volgenant:
Edge exchanges in the degree-constrained minimum spanning tree problem.
Computers & OR 12(4): 341-348 (1985) |
