Algorithms for the design of network topologies with balanced disjoint rings
From MaRDI portal
Publication:2267818
DOI10.1007/s10732-008-9085-zzbMath1181.90052OpenAlexW2068401401MaRDI QIDQ2267818
Sarath K. S. Kumar, Üster, Halit
Publication date: 2 March 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-008-9085-z
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem, A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem, A hybrid genetic algorithm for the Hamiltonian p‐median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Hamiltonian p-median problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Topological design of ring networks
- The Hamiltonian \(p\)-median problem
- Heuristic solutions to multi-depot location-routing problems
- Greedy randomized adaptive search procedures
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
