A 2-phase algorithm for solving the single allocation p-hub center problem
From MaRDI portal
Publication:833530
DOI10.1016/J.COR.2008.07.011zbMATH Open1176.90360OpenAlexW2155887048MaRDI QIDQ833530FDOQ833530
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.07.011
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Integer programming formulations of discrete hub location problems
- Network hub location problems: The state of the art
- Title not available (Why is that?)
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- On the single-assignment \(p\)-hub center problem
- The \(p\)-hub center allocation problem
Cited In (31)
- The \(p\)-hub center allocation problem
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU
- Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Multimodal freight transportation planning: a literature review
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- Single-allocation ordered median hub location problems
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A non-triangular hub location problem
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- Improved hardness and approximation results for single allocation hub location
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- Solving large single allocation \(p\)-hub problems with two or three hubs
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Improved hardness and approximation results for single allocation hub location problems
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Team formation based on group technology: a hybrid grouping genetic algorithm approach
- Aggregation in hub location problems
- On the single-assignment \(p\)-hub center problem
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- HUBBI: iterative network design for incomplete hub location problems
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
- An efficient heuristic for a hub location routing problem
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
Uses Software
Recommendations
- The \(p\)-hub center allocation problem π π
- Uncapacitated single and multiple allocation \(p\)-hub center problems π π
- Solving large single allocation \(p\)-hub problems with two or three hubs π π
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations π π
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems π π
This page was built for publication: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833530)