Insertion heuristics for central cycle problems

DOI10.1002/NET.20348MaRDI QIDQ3057168zbMATH OpenOpenAlexFDO

Authors John D. Lamb

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

zbMATH Keywords

centercyclecycle-lengtheccentricitytour

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient heuristics for Median Cycle Problems
• Modelling and solving central cycle problems with integer programming.
• A heuristic for the p-center problem in graphs
• Not all insertion methods yield constant approximate tours in the Euclidean plane
• Locating median cycles in networks

Cites work

• \(k\)-center problems with minimum coverage
• A review of extensive facility location in networks
• A simple heuristic for the p-centre problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Dominant, an algorithm for the \(p\)-center problem.
• Easy and hard bottleneck location problems
• Generalized p-center problems: Complexity results and approximation algorithms
• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• Large-scale local search heuristics for the capacitated vertexp-center problem
• Lexicographic local search and the \(p\)-center problem.
• Locating a cycle in a transportation or a telecommunications network
• Locating median cycles in networks
• Modelling and solving central cycle problems with integer programming.
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The Covering Salesman Problem
• The Covering Tour Problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• The p-Centre Problem-Heuristic and Optimal Algorithms
• The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem

Cited in

(2)

• Location of speed-up subnetworks
• Efficient heuristics for Median Cycle Problems

Describes a project that uses

Uses Software

• TSPLIB
• Boost

This page was built for publication: Insertion heuristics for central cycle problems

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