|
Search the dblp DataBase
Martin W. P. Savelsbergh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
Valid Inequalities for Problems with Additive Variable Upper Bounds. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:60-72 [Conf]
- Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
Sequence Independent Lifting of Cover Inequalities. [Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:452-461 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] IPCO, 2001, pp:318-332 [Conf]
- Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey
Online Resource Minimization. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:576-585 [Conf]
- Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:453-462 [Conf]
- Martin W. P. Savelsbergh, Ton Volgenant
Edge exchanges in the degree-constrained minimum spanning tree problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 1985, v:12, n:4, pp:341-348 [Journal]
- Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh
Analysis of bounds for a capacitated single-item lot-sizing problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 2007, v:34, n:6, pp:1721-1743 [Journal]
- Martin W. P. Savelsbergh, Jin-Hwa Song
Inventory routing with continuous moves. [Citation Graph (0, 0)][DBLP] Computers & OR, 2007, v:34, n:6, pp:1744-1763 [Journal]
- Özlem Ergun, Gültekin Kuyzu, Martin W. P. Savelsbergh
Shipper collaboration. [Citation Graph (0, 0)][DBLP] Computers & OR, 2007, v:34, n:6, pp:1551-1560 [Journal]
- Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey
Scheduling projects with labor constraints. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:27-52 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:103-121 [Journal]
- Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:42, n:2, pp:211-225 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2001, v:7, n:4, pp:351-369 [Journal]
- Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2000, v:12, n:2, pp:111-124 [Journal]
- Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2000, v:12, n:1, pp:2-23 [Journal]
- Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2001, v:13, n:3, pp:191-209 [Journal]
- Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2005, v:17, n:1, pp:123-136 [Journal]
- Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
Sequence Independent Lifting in Mixed Integer Programming. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2000, v:4, n:1, pp:109-129 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Math. Program., 2003, v:95, n:1, pp:71-90 [Journal]
- Brady Hunsaker, Martin W. P. Savelsbergh
Efficient feasibility testing for dial-a-ride problems. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:3, pp:169-173 [Journal]
- François Vanderbeck, Martin W. P. Savelsbergh
A generic view of Dantzig-Wolfe decomposition in mixed integer programming. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:3, pp:296-306 [Journal]
- Brady Hunsaker, Anton J. Kleywegt, Martin W. P. Savelsbergh, Craig A. Tovey
Optimal Online Algorithms for Minimax Resource Scheduling. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:16, n:4, pp:555-590 [Journal]
An optimization algorithm for the inventory routing problem with continuous moves. [Citation Graph (, )][DBLP]
A dynamic driver management scheme for less-than-truckload carriers. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.007secs
|