Graphical-structure-based models for routing problems
From MaRDI portal
Recommendations
Cites work
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Balanced optimization problems
- Complexity of spanning tree problems: Part I
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The complexity of restricted spanning tree problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(4)- Optimal resolution sequence of problems modelled by directed graphs
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- An advance in infinite graph models for the analysis of transportation networks
- Compact-port routing models and applications to distance-hereditary graphs
This page was built for publication: Graphical-structure-based models for routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799805)