The single allocation problem in the interacting three-hub network
From MaRDI portal
Recommendations
Cites work
- A linear program for the two-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Designing satellite communication networks by zero—one quadratic programming
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Heuristics for the p-hub location problem
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Hub Location and the p-Hub Median Problem
- Hub network design with single and multiple allocation: A computational study
- Integer programming formulations of discrete hub location problems
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Neural versus traditional approaches to the location of interacting hub facilities
- On tabu search for the location of interacting hub facilities
- The Complexity of Multiterminal Cuts
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cited in
(23)- A study of the quadratic semi-assignment polytope
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Solving large single allocation p-hub problems with two or three hubs
- An improved algorithm for fixed-hub single allocation problems
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Improved hardness and approximation results for single allocation hub location
- Approximation algorithms for median hub location problems
- 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
- Efficient algorithms for a simple network design problem
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
- Resolving interferences of triple‐crossover‐cranes by determining paths in networks
- Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- 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
- Some new clique inequalities in four-index hub location models
- Adapting polyhedral properties from facility to hub location problems
- A conditional p-hub location problem with attraction functions
This page was built for publication: The single allocation problem in the interacting three-hub network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944738)
