Modelling and solving central cycle problems with integer programming.
From MaRDI portal
Publication:1427116
DOI10.1016/S0305-0548(03)00066-2zbMath1036.90053MaRDI QIDQ1427116
John M. Wilson, Les R. Foulds, Tadashi Yamaguchi
Publication date: 14 March 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90B80: Discrete location and assignment
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