scispace - formally typeset
Journal ArticleDOI

General network design: A unified view of combined location and network design problems

TLDR
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.
About
This article is published in European Journal of Operational Research.The article was published on 2012-06-16. It has received 122 citations till now. The article focuses on the topics: Facility location problem & Network planning and design.

read more

Citations
More filters
Journal Article

Integer programming formulations of discrete hub location problems

James F. Campbell
- 01 Jan 1996 - 
TL;DR: In this paper, integer programming formulations for four types of discrete hub location problems are presented: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
Journal ArticleDOI

Twenty-Five Years of Hub Location Research

TL;DR: Insight into early motivations for analyzing hub location problems are provided and linkages to problems in location analysis and network design are described to suggest promising directions for future effort.
Book ChapterDOI

Hub Location Problems

TL;DR: This chapter overviews the key distinguishing features, assumptions and properties commonly considered in HLPs, and highlights the role location and network design decisions play in the formulation and solution of HLPs.
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

A competitive hub location and pricing problem

TL;DR: This model confirms that, in competitive settings, seeking the largest market share is dominated by profit maximization, and solves instances derived from the CAB dataset using a genetic algorithm and a closed expression for the optimal pricing.
References
More filters
Book

Network Flows: Theory, Algorithms, and Applications

TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Journal ArticleDOI

The Truck Dispatching Problem

TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.
Journal ArticleDOI

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

TL;DR: It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection.
Journal ArticleDOI

The maximal covering location problem

TL;DR: The use of a maximal service distance as a measure of the value of a given locational configuration has been discussed at length by Toregas and ReVelle 1 who show that it is an important surrogate measurement for the value.
Journal ArticleDOI

Facility location and supply chain management - A review

TL;DR: Basic features that facility location models must capture to support decision-making involved in strategic supply chain planning are identified and applications ranging across various industries are presented.
Related Papers (5)