Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
From MaRDI portal
Publication:1761222
DOI10.1016/j.cor.2012.02.005zbMath1251.90253OpenAlexW2110513532MaRDI QIDQ1761222
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.005
Related Items
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality ⋮ Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ A parameterized approximation algorithm for the multiple allocation \(k\)-hub center ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem ⋮ Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Allocation strategies in hub networks
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Hub location for time definite transportation
- Tight bounds from a path based formulation for the tree of hub location problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- A linear program for the two-hub location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Upper and lower bounds for the two-level simple plant location problem
- Integer programming formulations of discrete hub location problems
- The capacitated plant location problem
- On the single-assignment \(p\)-hub center problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A branch and cut algorithm for hub location problems with single assignment
- The simple plant location problem: Survey and synthesis
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- Release Time Scheduling and Hub Location for Next-Day Delivery
- Projecting the flow variables for hub location problems
- Model formulations for hub covering problems
- Designing satellite communication networks by zero—one quadratic programming
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Topological design of centralized computer networks—formulations and algorithms
- Efficient algorithms for the uncapacitated single allocation 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
- Solving the hub location problem in a star–star network
