Perspectives on integer programming for time-dependent models
From MaRDI portal
Publication:2001858
DOI10.1007/s11750-019-00514-4zbMath1418.90160OpenAlexW2943890712MaRDI QIDQ2001858
Natashia Boland, Savelsbergh, Martin W. P.
Publication date: 11 July 2019
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-019-00514-4
integer programmingtraveling salesman problem with time windowstime-expanded networkdynamic discretization discovery
Related Items
Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, An exact algorithm for the service network design problem with hub capacity constraints, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, Scalable timing-aware network design via Lagrangian decomposition, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels, Shared resources in collaborative vehicle routing
Uses Software
Cites Work
- Load-dependent and precedence-based models for pickup and delivery problems
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
- On the complexity of time-dependent shortest paths
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Layered graph approaches for combinatorial optimization problems
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- The time dependent traveling salesman problem: polyhedra and algorithm
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- Resource extension functions: properties, inversion, and generalization to segments
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
- A survey of resource constrained shortest path problems: Exact solution approaches
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- An Introduction to Network Flows over Time
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- A Class of Continuous Network Flow Problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Continuous-Time Service Network Design Problem
- An adaptive discretization algorithm for a class of continuous network programs
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- Shortest Path Problems with Resource Constraints
- Continuous-Time Flows in Networks
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
