Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
From MaRDI portal
Publication:1991103
DOI10.1016/j.ejor.2018.06.003zbMath1403.90587OpenAlexW2808122268MaRDI QIDQ1991103
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.003
Related Items
Dynamic programming in the routing problem: decomposition variant, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Load-dependent and precedence-based models for pickup and delivery problems
- Time-dependent routing problems: a review
- Elements of dynamic programming in extremal routing problems
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- A heuristic manipulation technique for the sequential ordering problem
- Hybrid control systems and the dynamic traveling salesman problem
- An inexact algorithm for the sequential ordering problem
- On estimating the number of order ideals in partial orders, with some applications
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Generalized delivery problem
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- The traveling salesman problem and its variations
- An improved ant colony system for the sequential ordering problem
- Hybrid optimization methods for time-dependent sequencing problems
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- The precedence-constrained asymmetric traveling salesman polytope
- A generalized Courier problem with the cost function depending on the list of tasks
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- Single-machine scheduling problems with past-sequence-dependent setup times
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- On Dynamic Programming Methods for Assembly Line Balancing
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- TSPLIB—A Traveling Salesman Problem Library
- Branch-and-Bound Strategies for Dynamic Programming
- Multivalued Decision Diagrams for Sequencing Problems
- Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman
- The Shortest Hamiltonian Chain of a Graph
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
- The Transitive Reduction of a Directed Graph
- Dynamic programming based metaheuristics for the dial-a-ride problem
