Topological design of ring networks

DOI10.1016/0305-0548(94)90029-9MaRDI QIDQ1318461zbMATH OpenOpenAlexFDO

Authors Kemal Altinkemer

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

zbMATH Keywords

heuristicnetwork designparallel savings algorithmring networkstravelling salesmanworst case error

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 432987
• Algorithms for the design of network topologies with balanced disjoint rings
• scientific article; zbMATH DE number 1487910
• The ring/-rings network design problem: model and branch-and-cut algorithm
• Designing tributary networks with multiple ring families.

Cites work

• An approach for solving a class of transportation scheduling problems
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Bounds and Heuristics for Capacitated Routing Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
• scientific article; zbMATH DE number 3621663 (Why is no real title available?)
• Parallel Savings Based Heuristics for the Delivery Problem
• Tight bounds for christofides' traveling salesman heuristic
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

Cited in

(17)

• Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees.
• Designing tributary networks with multiple ring families.
• A tabu search algorithm for self-healing ring network design.
• Hierarchical ring network design
• Algorithms for the design of network topologies with balanced disjoint rings
• Crossed rings -- small-diameter multiring switches and their 1-1-rearrangeability
• scientific article; zbMATH DE number 432987 (Why is no real title available?)
• Exact algorithms for the master ring problem
• scientific article; zbMATH DE number 714539 (Why is no real title available?)
• scientific article; zbMATH DE number 1086983 (Why is no real title available?)
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• scientific article; zbMATH DE number 1487910 (Why is no real title available?)
• Topological expansion of multiple-ring metropolitan area networks
• LP-based heuristic algorithms for interconnecting token rings via source routing bridges
• Models for a Steiner ring network design problem with revenues
• Valid inequalities and facets for multi‐module survivable network design problem
• Partition inequalities for capacitated survivable network design based on directed p-cycles

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Topological design of ring networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318461)