scispace - formally typeset
Journal ArticleDOI

Airline network design and hub location problems

Patrick Jaillet, +2 more
- 01 Oct 1996 - 
- Vol. 4, Iss: 3, pp 195-212
TLDR
This paper introduces flow-based models for designing capacitated networks and routing policies and proposes heuristic schemes based on mathematical programming for solving hub location problems and related routing policies.
About
This article is published in Location Science.The article was published on 1996-10-01. It has received 191 citations till now. The article focuses on the topics: Network planning and design & Integer programming.

read more

Citations
More filters
Journal ArticleDOI

Network hub location problems : The state of the art

TL;DR: This paper classifies and surveys network hub location models, includes some recent trends on hub location and provides a synthesis of the literature.
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

Survey: Hub location problems: A review of models, classification, solution techniques, and applications

TL;DR: This paper focuses on reviewing the most recent advances in HLP from 2007 up to now, and a review of all variants of HLPs (i.e., network, continuous, and discrete HLPs) is provided.
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.
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

A Quadratic Integer Program for the Location of Interacting Hub facilities

TL;DR: In this paper, a new formulation of a general hub location model as a quadratic integer program was reported, and a variety of alternative solution strategies were discussed. But the non-convexity of the objective function makes the problem difficult.
Journal ArticleDOI

Integer programming formulations of discrete hub location problems

TL;DR: In this article, the authors present integer programming formulations for four types of discrete hub location problems: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
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

Efficient algorithms for the uncapacitated single allocation p-hub median problem

TL;DR: In this article, a branch-and-bound LP formulation for the single allocation p-hub median problem is presented, which requires fewer variables and constraints than those traditionally used in the literature.
Related Papers (5)