The p-hub center allocation problem
From MaRDI portal
Publication:852943
DOI10.1016/J.EJOR.2005.09.024zbMATH Open1103.90057OpenAlexW2031373052MaRDI QIDQ852943FDOQ852943
Authors: Ann Melissa Campbell, Timothy J. Lowe, Li Zhang 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.024
Recommendations
- The uncapacitated r‐allocation p‐hub center problem
- On the single-assignment \(p\)-hub center problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
- Hub Location and the p-Hub Median Problem
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- scientific article; zbMATH DE number 5205606
- scientific article; zbMATH DE number 849074
Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Khachiyan’s algorithm for linear programming
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- A hybrid heuristic for the uncapacitated hub location problem
- Polynomial algorithms in linear programming
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A dual algorithm for the uncapacitated hub location problem
- Solution algorithms for the capacitated single allocation hub location problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- On the single-assignment \(p\)-hub center problem
- The latest arrival hub location problem
- Algorithms for solving the conditional covering problem on paths
- Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
- The generalized P‐forest problem on a tree network
Cited In (31)
- Title not available (Why is that?)
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- An efficient model for the multiple allocation hub maximal covering problem
- The single allocation problem in the interacting three-hub network
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Single-allocation ordered median hub location problems
- Hub location problems: the location of interacting facilities
- The stochastic \(p\)-hub center problem with service-level constraints
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- LTL logistics networks with differentiated services
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- Title not available (Why is that?)
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- Network hub location problems: The state of the art
- Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
- The multi-period \(p\)-center problem with time-dependent travel times
- Approximation algorithms for median hub location problems
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The two-echelon island fuel distribution problem
- Hub location problem considering spoke links with incentive-dependent capacities
- Aggregation in hub location problems
- The uncapacitated r‐allocation p‐hub center problem
- On the single-assignment \(p\)-hub center problem
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Hub Location and the p-Hub Median Problem
- Developing equilibrium optimization methods for hub location problems
- On the \(p\)-hub interdiction problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
Uses Software
This page was built for publication: The \(p\)-hub center allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852943)
