Hub Location Problems: The Location of Interacting Facilities
From MaRDI portal
Publication:5506727
DOI10.1007/978-1-4419-7572-0_12zbMath1388.90067OpenAlexW204207140MaRDI QIDQ5506727
Mehmet R. Taner, Bahar Yetis Kara
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/38348
Related Items (8)
Hub location problems with price sensitive demands ⋮ Endogenous effects of hubbing on flow intensities ⋮ Hub location under competition ⋮ A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ A leader-follower single allocation hub location problem under fixed markups ⋮ A competitive hub location and pricing problem
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Adapting polyhedral properties from facility to hub location problems
- Heuristics for the p-hub location problem
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- The \(p\)-hub center allocation problem
- On ``A quadratic integer program for the location of interacting hub facilities
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Location of hubs in a competitive environment
- 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
- On the single-assignment \(p\)-hub center problem
- A branch and cut algorithm for hub location problems with single assignment
- Network hub location problems: The state of the art
- The Latest Arrival Hub Location Problem
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
- A hub covering model for cargo delivery systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- The single-assignment hub covering problem: Models and linearizations
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
This page was built for publication: Hub Location Problems: The Location of Interacting Facilities
