Insertion heuristics for central cycle problems
From MaRDI portal
Publication:3057168
DOI10.1002/net.20348zbMath1298.05177OpenAlexW3122853765MaRDI QIDQ3057168
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20348
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A simple heuristic for the p-centre problem
- Easy and hard bottleneck location problems
- Generalized \(p\)-center problems: Complexity results and approximation algorithms
- A review of extensive facility location in networks
- The median tour and maximal covering tour problems: Formulations and heuristics
- Lexicographic local search and the \(p\)-center problem.
- Modelling and solving central cycle problems with integer programming.
- \(k\)-center problems with minimum coverage
- Dominant, an algorithm for the \(p\)-center problem.
- Locating median cycles in networks
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Locating a cycle in a transportation or a telecommunications network
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- The Covering Tour Problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Large-scale local search heuristics for the capacitated vertexp-center problem
- The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
- The Covering Salesman Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Insertion heuristics for central cycle problems
