The capacitated single-allocation hub location problem revisited: a note on a classical formulation
From MaRDI portal
Publication:992581
DOI10.1016/j.ejor.2010.04.015zbMath1205.90174OpenAlexW1975375864MaRDI QIDQ992581
Stefan Nickel, Isabel H. Correia, Francisco Saldanha-Da-gama
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-16173
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (17)
Spatial analysis of single allocation hub location problems ⋮ Endogenous effects of hubbing on flow intensities ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Single Allocation Hub Location with Heterogeneous Economies of Scale ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ General network design: a unified view of combined location and network design problems ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Hub and spoke network design with single-assignment, capacity decisions and balancing requirements ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Perspectives on modeling hub location problems ⋮ A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network ⋮ Modeling congestion and service time in hub location problems ⋮ Allocating nodes to hubs for minimizing the hubs processing resources: A case study ⋮ Designing a hub location and pricing network in a competitive environment
Uses Software
Cites Work
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- 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
- Integer programming formulations of discrete hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- A branch and cut algorithm for hub location problems with single assignment
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- A hub covering model for cargo delivery systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
This page was built for publication: The capacitated single-allocation hub location problem revisited: a note on a classical formulation
