A linear program for the two-hub location problem
From MaRDI portal
Recommendations
- On the Quadratic Programming Approach for Hub Location Problems
- A compact linearisation of Euclidean single allocation hub location problems
- A dual algorithm for the uncapacitated hub location problem
- A quadratic integer program for the location of interacting hub facilities
- The hub location and routing problem
- A non-triangular hub location problem
- Solving a capacitated hub location problem
- Integer programming formulations of discrete hub location problems
- A branch-and-cut algorithm for the hub location and routing problem
- On ``A quadratic integer program for the location of interacting hub facilities
Cites work
- A quadratic integer program for the location of interacting hub facilities
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Designing satellite communication networks by zero—one quadratic programming
- Heuristics for the p-hub location problem
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Integer programming formulations of discrete hub location problems
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- Network flows. Theory, algorithms, and applications.
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- On tabu search for the location of interacting hub facilities
- On the Location of Hub Facilities
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cited in
(23)- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Optimal use of hub facilities: A two-hub model with fixed arc costs
- Solving large single allocation p-hub problems with two or three hubs
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- Planar multifacility location problems with tree structure and finite dominating sets
- Improved hardness and approximation results for single allocation hub location
- Unmanned aerial vehicle hub-location and routing for monitoring geographic borders
- Star p-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- Improved hardness and approximation results for single allocation hub location problems
- Optimal Airline Networks, Flight Volumes, and the Number of Crafts for New Low-Cost Carrier in Japan
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- A compact linearisation of Euclidean single allocation hub location problems
- Allocation strategies in hub networks
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- The single allocation problem in the interacting three-hub network
- Dual-based approach for a hub network design problem under non-restrictive policy
- HubLocator: An exact solution method for the multiple allocation hub location problem
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
- Adapting polyhedral properties from facility to hub location problems
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- New complexity results for the \(p\)-hub median problem
This page was built for publication: A linear program for the two-hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278146)
