Savelsbergh, Martin W. P.

From MaRDI portal
Revision as of 12:53, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:163010

Available identifiers

zbMath Open savelsbergh.martin-w-pDBLP82/437WikidataQ102081015 ScholiaQ102081015MaRDI QIDQ163010

List of research outcomes





PublicationDate of PublicationType
A fast and robust algorithm for solving biobjective mixed integer programs2024-10-09Paper
An exact algorithm for the service network design problem with hub capacity constraints2023-12-12Paper
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers2023-11-23Paper
Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility2023-11-16Paper
Dynamic service area sizing in urban delivery2022-09-27Paper
Sequence independent lifting of cover inequalities2022-08-30Paper
Decomposition Branching for Mixed Integer Programming2022-08-05Paper
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems2022-06-30Paper
Multivariable Branching: A 0-1 Knapsack Problem Case Study2022-06-28Paper
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting2022-06-27Paper
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems2022-05-20Paper
Near real-time loadplan adjustments for less-than-truckload carriers2022-05-20Paper
Substitution-based equipment balancing in service networks with multiple equipment types2022-03-18Paper
Optimizing package express operations in China2022-03-11Paper
Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes2022-03-09Paper
The vehicle routing problem with heterogeneous locker boxes2021-06-16Paper
System optimal routing of traffic flows with user constraints using linear programming2021-06-07Paper
Hyperconnected Megacity Parcel Logistic: Joint Parcel Routing and Containerized Consolidation2021-03-02Paper
A column generation-based heuristic for the split delivery vehicle routing problem with time windows2021-02-08Paper
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method2020-12-11Paper
A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties2020-01-08Paper
Perspectives on integer programming for time-dependent models2019-07-11Paper
Rejoinder on: ``Perspectives on integer programming for time-dependent models2019-07-11Paper
Preprocessing and cut generation techniques for multi-objective binary programming2019-01-09Paper
Dealing with demand uncertainty in service network and load plan design2018-11-21Paper
A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem2018-11-21Paper
Nondominated Nash points: application of biobjective mixed integer programming2018-08-03Paper
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints2018-07-11Paper
Enhancing urban mobility: integrating ride-sharing and public transit2018-07-11Paper
Complexity of routing problems with release dates and deadlines2018-05-30Paper
The generalized independent set problem: polyhedral analysis and solution approaches2018-05-29Paper
The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs2018-05-29Paper
A new method for optimizing a linear function over the efficient set of a multiobjective integer program2018-05-29Paper
A note on shortest path problems with forbidden paths2018-05-23Paper
Scheduling reclaimers serving a stock pad at a coal terminal2018-04-03Paper
Adaptive kernel search: a heuristic for solving mixed integer linear programs2018-02-06Paper
The Continuous-Time Service Network Design Problem2017-12-15Paper
Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks2017-08-04Paper
Incremental Network Design with Minimum Spanning Trees2017-04-05Paper
A branch-and-price guided search approach to maritime inventory routing2017-01-05Paper
A reclaimer scheduling problem arising in coal stockyard management2016-11-16Paper
Creating schedules and computing operating costs for LTL load plans2016-11-14Paper
Pricing for production and delivery flexibility in single-item lot-sizing2016-11-11Paper
A decision support tool for generating shipping data for the Hunter Valley coal chain2016-11-10Paper
The bi-objective mixed capacitated general routing problem with different route balance criteria2016-10-07Paper
Incremental network design with maximum flows2016-07-08Paper
The Fixed-Charge Shortest-Path Problem2016-06-29Paper
Incremental network design with shortest paths2016-06-23Paper
The \(L\)-shape search method for triobjective integer programming2016-06-20Paper
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method2016-04-25Paper
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method2016-04-25Paper
EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING2016-02-22Paper
Boosting the feasibility pump2015-09-16Paper
Stratified Patient Appointment Scheduling for Community-based Chronic Disease Management Programs2015-05-28Paper
Exploration of models for a cargo assembly planning problem2015-04-02Paper
Pricing to accelerate demand learning in dynamic assortment planning for perishable products2015-02-04Paper
Restrict-and-relax search for 0-1 mixed-integer programs2014-09-30Paper
Optimization for dynamic ride-sharing: a review2014-07-27Paper
The Triangle Splitting Method for Biobjective Mixed Integer Programming2014-06-02Paper
Balancing fleet size and repositioning costs in LTL trucking2013-08-08Paper
Allocating Cost of Service to Customers in Inventory Routing2013-07-02Paper
Truck driver scheduling in Australia2012-11-15Paper
Branch-and-Price Guided Search2012-11-02Paper
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem2012-07-28Paper
An Automated Intensity-Modulated Radiation Therapy Planning System2012-07-28Paper
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem2012-07-28Paper
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing2012-06-18Paper
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems2012-06-08Paper
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems2012-05-30Paper
Decomposing inventory routing problems with approximate value functions2011-01-06Paper
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints2010-11-24Paper
Inventory Routing2010-06-02Paper
Robust Optimization for Empty Repositioning Problems2010-03-06Paper
Information-based branching schemes for binary linear mixed integer problems2010-03-01Paper
Vendor managed inventory for environments with stochastic product usage2009-11-27Paper
Delivery strategies for blood products supplies2009-09-18Paper
Approximating the stability region for binary mixed-integer programs2009-08-14Paper
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements2008-05-16Paper
A dynamic driver management scheme for less-than-truckload carriers2008-04-28Paper
An optimization algorithm for the inventory routing problem with continuous moves2008-01-23Paper
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem2008-01-21Paper
Competitive analysis for dynamic multiperiod uncapacitated routing problems2007-07-30Paper
Shipper collaboration2007-01-09Paper
Analysis of bounds for a capacitated single-item lot-sizing problem2007-01-09Paper
Inventory routing with continuous moves2007-01-09Paper
A generic view of Dantzig--Wolfe decomposition in mixed integer programming2006-06-30Paper
Integer-programming software systems2006-03-07Paper
The mixed vertex packing problem.2004-02-18Paper
Optimal Online Algorithms for Minimax Resource Scheduling2004-01-08Paper
Bidirected and unidirected capacity installation in telecommunication networks.2004-01-05Paper
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity2003-12-16Paper
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition2003-11-06Paper
On the polyhedral structure of a multi-item production planning model with setup times2003-10-29Paper
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case2003-10-29Paper
The Stochastic Inventory Routing Problem with Direct Deliveries2003-07-07Paper
The relation of time indexed formulations of single machine scheduling problems to the node packing problem2003-06-30Paper
Efficient feasibility testing for dial-a-ride problems2003-04-02Paper
https://portal.mardi4nfdi.de/entity/Q45377522002-06-20Paper
Valid inequalities for problems with additive variable upper bounds2002-05-27Paper
Drive: Dynamic Routing of Independent Vehicles2002-03-18Paper
Scheduling projects with labor constraints2002-02-27Paper
Branch-and-Price: Column Generation for Solving Huge Integer Programs2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q45322342002-01-01Paper
Polyhedral results for the edge capacity polytope.2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49552672001-11-08Paper
Sequence independent lifting in mixed integer programming2001-07-19Paper
Conflict graphs in solving integer programming problems2001-05-02Paper
Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs2000-11-12Paper
A polyhedral approach to single-machine scheduling problems.2000-11-12Paper
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q42502132000-06-21Paper
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42637021999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42523361999-09-15Paper
A Computational Study of Search Strategies for Mixed Integer Programming1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43651351998-05-25Paper
A Branch-and-Price Algorithm for the Generalized Assignment Problem1998-04-20Paper
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems1996-09-01Paper
The General Pickup and Delivery Problem1995-06-21Paper
MINTO, a Mixed INTeger Optimizer1995-02-19Paper
Preprocessing and Probing Techniques for Mixed Integer Programming Problems1995-01-11Paper
Sequential and parallel local search for the time-constrained traveling salesman problem1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40356321993-05-18Paper
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40032321993-01-23Paper
A classification scheme for vehicle routing and scheduling problems1990-01-01Paper
An efficient implementation of local search algorithms for constrained routing problems1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30335851989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37838271988-01-01Paper
Edge exchanges in the degree-constrained minimum spanning tree problem1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51867321984-01-01Paper

Research outcomes over time

This page was built for person: Savelsbergh, Martin W. P.