Martin W. P. Savelsbergh

According to our database1, Martin W. P. Savelsbergh authored at least 155 papers between 1985 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows.
Transp. Sci., 2020

Workforce Scheduling in the Era of Crowdsourced Delivery.
Transp. Sci., 2020

The Continuous-Time Inventory-Routing Problem.
Transp. Sci., 2020

Same-Day Delivery with Drone Resupply.
Transp. Sci., 2020

Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers.
Networks, 2020

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method.
INFORMS J. Comput., 2020

Logistics optimization for a coal supply chain.
J. Heuristics, 2020

2019
Provably High-Quality Solutions for the Meal Delivery Routing Problem.
Transp. Sci., 2019

Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility.
Int. Trans. Oper. Res., 2019

Preprocessing and cut generation techniques for multi-objective binary programming.
Eur. J. Oper. Res., 2019

Cost allocation under competition: a new rail access charging policy.
EURO J. Transp. Logist., 2019

The price of discretizing time: a study in service network design.
EURO J. Transp. Logist., 2019

Throughput optimisation in a coal export system with multiple terminals and shared resources.
Comput. Ind. Eng., 2019

2018
Stochastic Inventory Routing for Perishable Products.
Transp. Sci., 2018

Complexity of routing problems with release dates and deadlines.
Eur. J. Oper. Res., 2018

Maximising Throughput in a Complex Coal Export System.
CoRR, 2018

Enhancing urban mobility: Integrating ride-sharing and public transit.
Comput. Oper. Res., 2018

A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints.
Comput. Oper. Res., 2018

Nondominated Nash points: application of biobjective mixed integer programming.
4OR, 2018

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Dealing with Demand Uncertainty in Service Network and Load Plan Design.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
Scheduling reclaimers serving a stock pad at a coal terminal.
J. Sched., 2017

Incremental Network Design with Minimum Spanning Trees.
J. Graph Algorithms Appl., 2017

The Continuous-Time Service Network Design Problem.
Oper. Res., 2017

Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs.
Eur. J. Oper. Res., 2017

The generalized independent set problem: Polyhedral analysis and solution approaches.
Eur. J. Oper. Res., 2017

A new method for optimizing a linear function over the efficient set of a multiobjective integer program.
Eur. J. Oper. Res., 2017

The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs.
Eur. J. Oper. Res., 2017

An extended demand responsive connector.
EURO J. Transp. Logist., 2017

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
50th Anniversary Invited Article - City Logistics: Challenges and Opportunities.
Transp. Sci., 2016

Editorial - A Major Milestone: <i>Transportation Science</i> Turns Fifty.
Transp. Sci., 2016

Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design.
Transp. Sci., 2016

A reclaimer scheduling problem arising in coal stockyard management.
J. Sched., 2016

The <i>L</i>-shape search method for triobjective integer programming.
Math. Program. Comput., 2016

Proximity Benders: a decomposition heuristic for stochastic programs.
J. Heuristics, 2016

The bi-objective mixed capacitated general routing problem with different route balance criteria.
Eur. J. Oper. Res., 2016

The Vehicle Routing Problem with Occasional Drivers.
Eur. J. Oper. Res., 2016

2015
Editorial Statement.
Transp. Sci., 2015

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method.
INFORMS J. Comput., 2015

A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method.
INFORMS J. Comput., 2015

Incremental network design with maximum flows.
Eur. J. Oper. Res., 2015

Possession assessment and capacity evaluation of the Central Queensland Coal Network.
EURO J. Transp. Logist., 2015

Cargo assembly planning.
EURO J. Transp. Logist., 2015

A decision support tool for generating shipping data for the Hunter Valley coal chain.
Comput. Oper. Res., 2015

2014
A note on shortest path problems with forbidden paths.
Networks, 2014

Boosting the feasibility pump.
Math. Program. Comput., 2014

Pricing to accelerate demand learning in dynamic assortment planning for perishable products.
Eur. J. Oper. Res., 2014

Incremental network design with shortest paths.
Eur. J. Oper. Res., 2014

Carbon-aware transport and logistics.
EURO J. Transp. Logist., 2014

Reclaimer Scheduling: Complexity and Algorithms.
CoRR, 2014

The Triangle Splitting Method for Biobjective Mixed Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Local Search for a Cargo Assembly Planning Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
Improved Load Plan Design Through Integer Programming Based Local Search.
Transp. Sci., 2013

Allocating Cost of Service to Customers in Inventory Routing.
Oper. Res., 2013

Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem.
INFORMS J. Comput., 2013

A pickup and delivery problem using crossdocks and truckload lane rates.
EURO J. Transp. Logist., 2013

Restrict-and-relax search for 0-1 mixed-integer programs.
EURO J. Comput. Optim., 2013

A branch-and-price guided search approach to maritime inventory routing.
Comput. Oper. Res., 2013

Creating schedules and computing operating costs for LTL load plans.
Comput. Oper. Res., 2013

Balancing fleet size and repositioning costs in LTL trucking.
Ann. Oper. Res., 2013

2012
Fixed-Charge Transportation with Product Blending.
Transp. Sci., 2012

A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing.
Oper. Res., 2012

The Fixed-Charge Shortest-Path Problem.
INFORMS J. Comput., 2012

Optimization for dynamic ride-sharing: A review.
Eur. J. Oper. Res., 2012

A stockyard planning problem.
EURO J. Transp. Logist., 2012

Pricing for production and delivery flexibility in single-item lot-sizing.
Comput. Oper. Res., 2012

Truck driver scheduling in Australia.
Comput. Oper. Res., 2012

Branch-and-Price Guided Search - (Extended Abstract).
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Lane-Exchange Mechanisms for Truckload Carrier Collaboration.
Transp. Sci., 2011

Time Slot Management in Attended Home Delivery.
Transp. Sci., 2011

Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem.
INFORMS J. Comput., 2011

2010
Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation.
Transp. Sci., 2010

The Vehicle Routing Problem with Stochastic Demand and Duration Constraints.
Transp. Sci., 2010

Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem.
INFORMS J. Comput., 2010

An Automated Intensity-Modulated Radiation Therapy Planning System.
INFORMS J. Comput., 2010

Vendor managed inventory for environments with stochastic product usage.
Eur. J. Oper. Res., 2010

2009
Branch and Price: Integer Programming with Column Generation.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Hybrid Solution Approach for Ready-Mixed Concrete Delivery.
Transp. Sci., 2009

The Trip Scheduling Problem.
Transp. Sci., 2009

Delivery strategies for blood products supplies.
OR Spectr., 2009

Approximating the stability region for binary mixed-integer programs.
Oper. Res. Lett., 2009

Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints.
Networks, 2009

ROUTE 2007: Recent advances in vehicle routing optimization.
Networks, 2009

Information-based branching schemes for binary linear mixed integer problems.
Math. Program. Comput., 2009

Robust Optimization for Empty Repositioning Problems.
Oper. Res., 2009

Using Branch-and-Price to Find High Quality Solutions Quickly.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.
Transp. Sci., 2008

Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.
Transp. Sci., 2008

An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem.
Transp. Sci., 2008

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements.
Discret. Optim., 2008

An optimization algorithm for the inventory routing problem with continuous moves.
Comput. Oper. Res., 2008

A dynamic driver management scheme for less-than-truckload carriers.
Comput. Oper. Res., 2008

2007
Performance Measurement for Inventory Routing.
Transp. Sci., 2007

Reducing Truckload Transportation Costs Through Collaboration.
Transp. Sci., 2007

Competitive analysis of a dispatch policy for a dynamic multi-period routing problem.
Oper. Res. Lett., 2007

Competitive analysis for dynamic multiperiod uncapacitated routing problems.
Networks, 2007

Inventory routing with continuous moves.
Comput. Oper. Res., 2007

Analysis of bounds for a capacitated single-item lot-sizing problem.
Comput. Oper. Res., 2007

Shipper collaboration.
Comput. Oper. Res., 2007

Chapter 6 Vehicle Routing.
Proceedings of the Transportation, 2007

Chapter 7 Transportation on Demand.
Proceedings of the Transportation, 2007

2006
Incentive Schemes for Attended Home Delivery Services.
Transp. Sci., 2006

Worst-Case Analysis for Split Delivery Vehicle Routing Problems.
Transp. Sci., 2006

A generic view of Dantzig-Wolfe decomposition in mixed integer programming.
Oper. Res. Lett., 2006

2005
Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container Terminal.
Transp. Sci., 2005

Decision Support for Consumer Direct Grocery Initiatives.
Transp. Sci., 2005

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.
INFORMS J. Comput., 2005

Integer-Programming Software Systems.
Ann. Oper. Res., 2005

2004
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem.
Transp. Sci., 2004

A Decomposition Approach for the Inventory-Routing Problem.
Transp. Sci., 2004

Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems.
Transp. Sci., 2004

Delivery Volume Optimization.
Transp. Sci., 2004

2003
Optimal Online Algorithms for Minimax Resource Scheduling.
SIAM J. Discret. Math., 2003

On the polyhedral structure of a multi-item production planning model with setup times.
Math. Program., 2003

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case.
Math. Program., 2003

Bidirected and unidirected capacity installation in telecommunication networks.
Discret. Appl. Math., 2003

2002
The Stochastic Inventory Routing Problem with Direct Deliveries.
Transp. Sci., 2002

Efficient feasibility testing for dial-a-ride problems.
Oper. Res. Lett., 2002

The relation of time indexed formulations of single machine scheduling problems to the node packing problem.
Math. Program., 2002

Polyhedral results for the edge capacity polytope.
Math. Program., 2002

A branch and cut approach to the cardinality constrained circuit problem.
Math. Program., 2002

Inventory Routing in Practice.
Proceedings of the Vehicle Routing Problem., 2002

2001
Valid inequalities for problems with additive variable upper bounds.
Math. Program., 2001

A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems.
INFORMS J. Comput., 2001

An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems.
J. Heuristics, 2001

Scheduling projects with labor constraints.
Discret. Appl. Math., 2001

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000
The mixed vertex packing problem.
Math. Program., 2000

Sequence Independent Lifting in Mixed Integer Programming.
J. Comb. Optim., 2000

A Relational Modeling System for Linear and Integer Programming.
Oper. Res., 2000

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition.
INFORMS J. Comput., 2000

Time-Indexed Formulations for Machine Scheduling Problems: Column Generation.
INFORMS J. Comput., 2000

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra.
Eur. J. Oper. Res., 2000

Conflict graphs in solving integer programming problems.
Eur. J. Oper. Res., 2000

1999
Lifted flow cover inequalities for mixed 0-1 integer programs.
Math. Program., 1999

A polyhedral approach to single-machine scheduling problems.
Math. Program., 1999

A Computational Study of Search Strategies for Mixed Integer Programming.
INFORMS J. Comput., 1999

Lifted Cover Inequalities for 0-1 Integer Programs: Complexity.
INFORMS J. Comput., 1999

Towards a model and algorithm management system for vehicle routing and scheduling problems.
Decis. Support Syst., 1999

Online Resource Minimization.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Drive: Dynamic Routing of Independent Vehicles.
Oper. Res., 1998

Branch-and-Price: Column Generation for Solving Huge Integer Programs.
Oper. Res., 1998

Lifted Cover Inequalities for 0-1 Integer Programs: Computation.
INFORMS J. Comput., 1998

1997
A Branch-and-Price Algorithm for the Generalized Assignment Problem.
Oper. Res., 1997

1996
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.
J. Heuristics, 1996

Towards a planning board generator.
Decis. Support Syst., 1996

1995
The General Pickup and Delivery Problem.
Transp. Sci., 1995

Sequence Independent Lifting of Cover Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
MINTO, a mixed INTeger optimizer.
Oper. Res. Lett., 1994

Preprocessing and Probing Techniques for Mixed Integer Programming Problems.
INFORMS J. Comput., 1994

1993
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.
Discret. Appl. Math., 1993

1992
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration.
INFORMS J. Comput., 1992

1988
Behind the screen: DSS from an OR point of view.
Decis. Support Syst., 1988

1985
Edge exchanges in the degree-constrained minimum spanning tree problem.
Comput. Oper. Res., 1985


  Loading...