Journal ArticleDOI
The Ring Star Problem: Polyhedral analysis and exact algorithm
TLDR
This article formulates the Ring Star Problem as a mixed-integer linear program and strengthens it with the introduction of several families of valid inequalities that are shown to be facet-defining and are used to develop a branch-and-cut algorithm.Abstract:
In the Ring Star Problem, the aim is to locate a simple cycle through a subset of vertices of a graph with the objective of minimizing the sum of two costs: a ring cost proportional to the length of the cycle and an assignment cost from the vertices not in the cycle to their closest vertex on the cycle. The problem has several applications in telecommunications network design and in rapid transit systems planning. It is an extension of the classical location–allocation problem introduced in the early 1960s, and closely related versions have been recently studied by several authors. This article formulates the problem as a mixed-integer linear program and strengthens it with the introduction of several families of valid inequalities. These inequalities are shown to be facet-defining and are used to develop a branch-and-cut algorithm. Computational results show that instances involving up to 300 vertices can be solved optimally using the proposed methodology. © 2004 Wiley Periodicals, Inc.read more
Citations
More filters
Journal ArticleDOI
Redesigning Benders Decomposition for Large-Scale Facility Location
TL;DR: Motivated by recent UFL applications in business analytics, approaches that work on a projected decision space and hence are intrinsically more scalable for large-scale input data are revised.
Journal ArticleDOI
The Tree of Hubs Location Problem
TL;DR: This paper presents the Tree of Hubs Location Problem, a network hub location problem with single assignment where a fixed number of hubs have to be located, with the particularity that it is required that the hubs are connected by means of a tree.
Journal ArticleDOI
General network design: A unified view of combined location and network design problems
Ivan Contreras,Elena Fernández +1 more
TL;DR: A unified framework for the general network design problem which encompasses several classical problems involving combined location and network design decisions, and relevant modeling aspects, alternative formulations and possible algorithmic strategies are presented and analyzed.
Journal ArticleDOI
The Capacitated m-Ring-Star Problem
TL;DR: Two integer programming formulations for the Capacitated m-Ring-Star Problem are presented and valid inequalities are proposed to strengthen the linear programming relaxation and are used as cutting planes in a branch-and-cut approach.
Journal Article
The Capacitated m-Ring Star Problem
References
More filters
Journal ArticleDOI
TSPLIB—A Traveling Salesman Problem Library
TL;DR: This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.
Book
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).
Book
Facility location : applications and theory
Zvi Drezner,Horst W. Hamacher +1 more
TL;DR: The Weber Problem, a study of location problems in the public sector, and an Efficient Genetic Algorithm for the p-Median Problem, provide insights into the design of location models.
Journal ArticleDOI
Location-Allocation Problems
TL;DR: The calculational aspects of solving certain classes of location-allocation problems are presented in this article, where exact extremal equations and a heuristic method are presented for solving these problems, and directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.
Journal ArticleDOI
THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization
TL;DR: Combinatorial OptimizationAdvanced Intelligent Computing Theories and ApplicationsOpt ArtHybrid Feedback ControlAdvances in Multi-Objective Nature Inspired ComputingThe Traveling Salesman ProblemIntelligent Computational Optimization in EngineeringThe Traveled SalesmanFundamental Problems in ComputingSpecial Cases of the Traveling salesman Problem