The constrained shortest path tour problem
From MaRDI portal
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Recommendations
- An efficient exact approach for the constrained shortest path tour problem
- Constrained shortest path tour problem: branch-and-price algorithm
- Solving the shortest path tour problem
- Complexity analysis and optimization of the shortest path tour problem
- A generalized shortest path tour problem with time windows
Cites work
- A note on two problems in connexion with graphs
- A probabilistic heuristic for a computationally difficult set covering problem
- An annotated bibliography of GRASP – Part I: Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- Complexity analysis and optimization of the shortest path tour problem
- Dynamic programming and optimal control. Vol. 1.
- GRASP: An annoted bibliography
- Greedy randomized adaptive search procedures
- Network survivability modeling
- Reducibility among combinatorial problems
- Solving the shortest path tour problem
- The edge Hamiltonian path problem is NP-complete
Cited in
(20)- Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
- A generalized shortest path tour problem with time windows
- An exact reduction technique for the k-colour shortest path problem
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
- Constrained shortest path tour problem: branch-and-price algorithm
- Shortest path tour problem with time windows
- An auction-based approach for the re-optimization shortest path tree problem
- Solving the shortest path tour problem
- scientific article; zbMATH DE number 1445588 (Why is no real title available?)
- An efficient exact approach for the constrained shortest path tour problem
- Solution approaches for the vehicle routing problem with occasional drivers and time windows
- Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
- Shortest paths with exclusive-disjunction arc pairs conflicts
- Efficient GRASP solution approach for the prisoner transportation problem
- Introduction to routing problems with mandatory transitions
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
- Reliable production process design problem: compact MILP model and ALNS-based primal heuristic
- Complexity analysis and optimization of the shortest path tour problem
- The ripple-spreading algorithm for shortest path tour problems
This page was built for publication: The constrained shortest path tour problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342457)
