Modelling and solving central cycle problems with integer programming.

DOI10.1016/S0305-0548(03)00066-2zbMath1036.90053OpenAlexW2023972910MaRDI QIDQ1427116

Les R. Foulds, Tadashi Yamaguchi, John M. Wilson

Publication date: 14 March 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00066-2

zbMATH Keywords

Integer programmingLocationGraphCycle centreCycle centroidCycle median

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (2)

Variable neighbourhood structures for cycle location problems ⋮ Insertion heuristics for central cycle problems

Cites Work

• Unnamed Item
• A review of extensive facility location in networks
• The median tour and maximal covering tour problems: Formulations and heuristics
• On Locating a Facility to Service Areas within a Network
• The Circuit Polytope: Facets
• Efficient heuristics for Median Cycle Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Modelling and solving central cycle problems with integer programming.