 | 2009 |
|---|
| 51 |       | Martin W. P. Savelsbergh:
Branch and Price: Integer Programming with Column Generation.
Encyclopedia of Optimization 2009: 328-332 |
| 50 | | Fatma Kilinç-Karzan,
Alejandro Toriello,
Shabbir Ahmed,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Approximating the stability region for binary mixed-integer programs.
Oper. Res. Lett. 37(4): 250-254 (2009) |
| 49 | | Alan L. Erera,
Juan C. Morales,
Martin W. P. Savelsbergh:
Robust Optimization for Empty Repositioning Problems.
Operations Research 57(2): 468-483 (2009) |
| 48 | | Verena Schmid,
Karl F. Doerner,
Richard F. Hartl,
Martin W. P. Savelsbergh,
Wolfgang Stoecher:
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery.
Transportation Science 43(1): 70-85 (2009) |
| 2008 |
|---|
| 47 | | Alan L. Erera,
Burak Karacik,
Martin W. P. Savelsbergh:
A dynamic driver management scheme for less-than-truckload carriers.
Computers & OR 35(11): 3397-3411 (2008) |
| 46 | | 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) |
| 45 | | 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) |
| 44 | | Claudia Archetti,
Maria Grazia Speranza,
Martin W. P. Savelsbergh:
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem.
Transportation Science 42(1): 22-31 (2008) |
| 43 | | Daniel Espinoza,
R. Garcia,
Marcos Goycoolea,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.
Transportation Science 42(3): 263-278 (2008) |
| 42 | | Daniel Espinoza,
R. Garcia,
Marcos Goycoolea,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.
Transportation Science 42(3): 279-291 (2008) |
| 2007 |
|---|
| 41 | | Özlem Ergun,
Gültekin Kuyzu,
Martin W. P. Savelsbergh:
Shipper collaboration.
Computers & OR 34(6): 1551-1560 (2007) |
| 40 | | 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) |
| 39 | | Martin W. P. Savelsbergh,
Jin-Hwa Song:
Inventory routing with continuous moves.
Computers & OR 34(6): 1744-1763 (2007) |
| 38 | | Enrico Angelelli,
Maria Grazia Speranza,
Martin W. P. Savelsbergh:
Competitive analysis for dynamic multiperiod uncapacitated routing problems.
Networks 49(4): 308-317 (2007) |
| 37 | | 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) |
| 36 | | Jin-Hwa Song,
Martin W. P. Savelsbergh:
Performance Measurement for Inventory Routing.
Transportation Science 41(1): 44-54 (2007) |
| 35 | | Özlem Ergun,
Gültekin Kuyzu,
Martin W. P. Savelsbergh:
Reducing Truckload Transportation Costs Through Collaboration.
Transportation Science 41(2): 206-221 (2007) |
| 2006 |
|---|
| 34 | | 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) |
| 33 | | Claudia Archetti,
Martin W. P. Savelsbergh,
Maria Grazia Speranza:
Worst-Case Analysis for Split Delivery Vehicle Routing Problems.
Transportation Science 40(2): 226-234 (2006) |
| 32 | | Ann Melissa Campbell,
Martin W. P. Savelsbergh:
Incentive Schemes for Attended Home Delivery Services.
Transportation Science 40(3): 327-341 (2006) |
| 2005 |
|---|
| 31 | | Alper Atamtürk,
Martin W. P. Savelsbergh:
Integer-Programming Software Systems.
Annals OR 140(1): 67-124 (2005) |
| 30 | | 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) |
| 29 | | Iris F. A. Vis,
René M. B. M. de Koster,
Martin W. P. Savelsbergh:
Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container Terminal.
Transportation Science 39(2): 249-260 (2005) |
| 28 | | Ann Melissa Campbell,
Martin W. P. Savelsbergh:
Decision Support for Consumer Direct Grocery Initiatives.
Transportation Science 39(3): 313-327 (2005) |
| 2004 |
|---|
| 27 | | Anton J. Kleywegt,
Vijay S. Nori,
Martin W. P. Savelsbergh:
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem.
Transportation Science 38(1): 42-70 (2004) |
| 26 | | Ann Melissa Campbell,
Martin W. P. Savelsbergh:
Delivery Volume Optimization.
Transportation Science 38(2): 210-223 (2004) |
| 25 | | Ann Melissa Campbell,
Martin W. P. Savelsbergh:
Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems.
Transportation Science 38(3): 369-378 (2004) |
| 24 | | Ann Melissa Campbell,
Martin W. P. Savelsbergh:
A Decomposition Approach for the Inventory-Routing Problem.
Transportation Science 38(4): 488-502 (2004) |
| 2003 |
|---|
| 23 | | 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) |
| 22 | | 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) |
| 21 | | 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 |
|---|
| 20 | | Brady Hunsaker,
Martin W. P. Savelsbergh:
Efficient feasibility testing for dial-a-ride problems.
Oper. Res. Lett. 30(3): 169-173 (2002) |
| 19 | | Anton J. Kleywegt,
Vijay S. Nori,
Martin W. P. Savelsbergh:
The Stochastic Inventory Routing Problem with Direct Deliveries.
Transportation Science 36(1): 94-118 (2002) |
| 2001 |
|---|
| 18 | | 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 |
| 17 |  | 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) |
| 16 | | 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) |
| 15 | | 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 |
|---|
| 14 | | 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) |
| 13 | | 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) |
| 12 | | 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 |
|---|
| 11 | | Alper Atamtürk,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Valid Inequalities for Problems with Additive Variable Upper Bounds.
IPCO 1999: 60-72 |
| 10 | | Anton J. Kleywegt,
Vijay S. Nori,
Martin W. P. Savelsbergh,
Craig A. Tovey:
Online Resource Minimization.
SODA 1999: 576-585 |
| 9 | | Zonghao Gu,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity.
INFORMS Journal on Computing 11(1): 117-123 (1999) |
| 8 | | Jeff T. Linderoth,
Martin W. P. Savelsbergh:
A Computational Study of Search Strategies for Mixed Integer Programming.
INFORMS Journal on Computing 11(2): 173-187 (1999) |
| 1998 |
|---|
| 7 | | Martin W. P. Savelsbergh,
R. N. Uma,
Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
SODA 1998: 453-462 |
| 6 | | Zonghao Gu,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Computation.
INFORMS Journal on Computing 10(4): 427-437 (1998) |
| 1995 |
|---|
| 5 | | Zonghao Gu,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Sequence Independent Lifting of Cover Inequalities.
IPCO 1995: 452-461 |
| 1994 |
|---|
| 4 | | Martin W. P. Savelsbergh:
Preprocessing and Probing Techniques for Mixed Integer Programming Problems.
INFORMS Journal on Computing 6(4): 445-454 (1994) |
| 1993 |
|---|
| 3 | | 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) |
| 1992 |
|---|
| 2 | | Martin W. P. Savelsbergh:
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration.
INFORMS Journal on Computing 4(2): 146-154 (1992) |
| 1985 |
|---|
| 1 | | Martin W. P. Savelsbergh,
Ton Volgenant:
Edge exchanges in the degree-constrained minimum spanning tree problem.
Computers & OR 12(4): 341-348 (1985) |
