Location of hubs in a competitive environment
From MaRDI portal
Publication:1296365
DOI10.1016/S0377-2217(98)00195-7zbMath0957.90079OpenAlexW2041553626WikidataQ126645332 ScholiaQ126645332MaRDI QIDQ1296365
Daniel Serra, Vladimir Marianov, Charles S. Re Velle
Publication date: 2 August 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00195-7
Related Items
A conditional \(p\)-hub location problem with attraction functions, The hub location and pricing problem, Competitive multiple allocation hub location problem considering primary and backup routes, Hub location under competition, A note on ``Location of hubs in a competitive environment, A Stackelberg hub arc location model for a competitive environment, Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems, An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty, A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand, Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem, The profit-oriented hub line location problem with elastic demand, An efficient model for the multiple allocation hub maximal covering problem, Cournot-Stackelberg games in competitive delocation, Matheuristics for optimizing the network in German wagonload traffic, Location models for airline hubs behaving as \(M/D/c\) queues., Alternate second order conic program reformulations for hub location under stochastic demand and congestion, Exact solution of hub network design problems with profits, The hub location problem with market selection, Alternate solution approaches for competitive hub location problems, Perspectives on modeling hub location problems, On carriers collaboration in hub location problems, Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem, Designing a hub location and pricing network in a competitive environment, Competition in a deregulated air transportation market, Hub Location Problems: The Location of Interacting Facilities, A competitive hub location and pricing problem
Uses Software
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Topological design of telecommunication networks --- local access design methods
- Locating concentrators in centralized computer networks
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- The hub location and routing problem
- Tabu Search—Part I
- Tabu Search—Part II
- Bandwidth Packing: A Tabu Search Approach
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
