Martin Savelsbergh
32 catalog papers. Identity-linked publications and additional name matches are distinguished below.
ORCID: 0000-0001-7031-5516
H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Publications
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems — INFORMS Journal on Computing 2022
- Decomposition Branching for Mixed Integer Programming — Operations Research 2022
- Multivariable Branching: A 0-1 Knapsack Problem Case Study — INFORMS Journal on Computing 2021
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting — INFORMS Journal on Computing 2021
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method — INFORMS Journal on Computing 2020
- Crowdshipping and Same-day Delivery: Employing In-store Customers to Deliver Online Orders — Production and Operations Management 2020
- The Continuous-Time Service Network Design Problem — Operations Research 2017
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method — INFORMS Journal on Computing 2015
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method — INFORMS Journal on Computing 2015
- Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem — INFORMS Journal on Computing 2013
- Allocating Cost of Service to Customers in Inventory Routing — Operations Research 2013
- The Fixed-Charge Shortest-Path Problem — INFORMS Journal on Computing 2012
- A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing — Operations Research 2012
- Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem — INFORMS Journal on Computing 2011
- An Automated Intensity-Modulated Radiation Therapy Planning System — INFORMS Journal on Computing 2010
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem — INFORMS Journal on Computing 2010
- Robust Optimization for Empty Repositioning Problems — Operations Research 2009
- An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems — INFORMS Journal on Computing 2005
- Thank You and Goodbye — Academy of Management Journal 2004
- A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems — INFORMS Journal on Computing 2001
- A Relational Modeling System for Linear and Integer Programming — Operations Research 2000
- EXPERIENCES WITH THE USE OF SUPPLY CHAIN MANAGEMENT SOFTWARE IN EDUCATION — Production and Operations Management 2000
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation — INFORMS Journal on Computing 2000
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition — INFORMS Journal on Computing 2000
- A Computational Study of Search Strategies for Mixed Integer Programming — INFORMS Journal on Computing 1999
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity — INFORMS Journal on Computing 1999
- Drive: Dynamic Routing of Independent Vehicles — Operations Research 1998
- Lifted Cover Inequalities for 0-1 Integer Programs: Computation — INFORMS Journal on Computing 1998
- Branch-and-Price: Column Generation for Solving Huge Integer Programs — Operations Research 1998
- A Branch-and-Price Algorithm for the Generalized Assignment Problem — Operations Research 1997
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems — ORSA Journal on Computing 1994
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration — ORSA Journal on Computing 1992