Topological design of ring networks
From MaRDI portal
Publication:1318461
DOI10.1016/0305-0548(94)90029-9zbMath0797.90106OpenAlexW1967714711MaRDI QIDQ1318461
Publication date: 27 March 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90029-9
Related Items
Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees., Valid inequalities and facets for multi‐module survivable network design problem, A tabu search algorithm for self-healing ring network design., Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Algorithms for the design of network topologies with balanced disjoint rings, Models for a Steiner ring network design problem with revenues, A directed cycle-based column-and-cut generation method for capacitated survivable network design
Uses Software
Cites Work
- Unnamed Item
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- An approach for solving a class of transportation scheduling problems
- Bounds and Heuristics for Capacitated Routing Problems
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Parallel Savings Based Heuristics for the Delivery Problem
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Tight bounds for christofides' traveling salesman heuristic