Perspectives on integer programming for time-dependent models
From MaRDI portal
Recommendations
- Comments on: ``Perspectives on integer programming for time-dependent models
- Comments on: ``Perspectives on integer programming for time-dependent models
- Comments on: ``Perspectives on integer programming for time-dependent models
- Rejoinder on: ``Perspectives on integer programming for time-dependent models
- Stochastic integer programming: general models and algorithms
- An integer programming approach for the time-dependent TSP
- Applied integer programming. Modeling and solution.
- Integer programming models for the q-mode problem
- Integer programming as a framework for optimization and approximability
- scientific article; zbMATH DE number 3908169
Cites work
- A Class of Continuous Network Flow Problems
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- A hybrid exact algorithm for the TSPTW
- A survey of resource constrained shortest path problems: exact solution approaches
- A time bucket formulation for the traveling salesman problem with time windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- An adaptive discretization algorithm for a class of continuous network programs
- 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
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- An introduction to network flows over time
- Continuous-Time Flows in Networks
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Layered graph approaches for combinatorial optimization problems
- Load-dependent and precedence-based models for pickup and delivery problems
- Modelling practical lot-sizing problems as mixed-integer programs
- New state-space relaxations for solving the traveling salesman problem with time windows
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- On the complexity of time-dependent shortest paths
- Path-reduced costs for eliminating arcs in routing and scheduling
- Resource extension functions: properties, inversion, and generalization to segments
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
- Shortest Path Problems with Resource Constraints
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- State-space relaxation procedures for the computation of bounds to routing problems
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- The Continuous-Time Service Network Design Problem
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The time dependent traveling salesman problem: polyhedra and algorithm
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(12)- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
- Shared resources in collaborative vehicle routing
- Comments on: ``Perspectives on integer programming for time-dependent models
- Rejoinder on: ``Perspectives on integer programming for time-dependent models
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels
- An exact algorithm for the service network design problem with hub capacity constraints
- 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
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
- Scalable timing-aware network design via Lagrangian decomposition
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
This page was built for publication: Perspectives on integer programming for time-dependent models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001858)
