Uncapacitated single and multiple allocation \(p\)-hub center problems
From MaRDI portal
Publication:1013401
DOI10.1016/j.cor.2008.08.021zbMath1158.90372OpenAlexW2118718359MaRDI QIDQ1013401
Houyuan Jiang, Andreas T. Ernst, Mohan Krishnamoorthy, Horst W. Hamacher, Gerhard J. Woeginger
Publication date: 17 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.021
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (40)
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Hub location for time definite transportation ⋮ Aggregation in hub location problems ⋮ A 2-phase algorithm for solving the single allocation \(p\)-hub center problem ⋮ The stochastic \(p\)-hub center problem with service-level constraints ⋮ Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion ⋮ Hub location under competition ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ The \(p\)-hub center allocation problem ⋮ A two-level location-allocation problem in designing local access fiber optic networks ⋮ 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 ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A non-triangular hub location problem ⋮ Allocation strategies in hub networks ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount ⋮ An intermodal hub location problem for container distribution in Indonesia ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ Developing equilibrium optimization methods for hub location problems ⋮ 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 ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ LTL logistics networks with differentiated services ⋮ Network hub location problems: The state of the art ⋮ An on-demand same-day delivery service using direct peer-to-peer transshipment strategies ⋮ Facility location models for distribution system design ⋮ The hub location problem with market selection ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Perspectives on modeling hub location problems ⋮ Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs ⋮ Improved hardness and approximation results for single allocation hub location ⋮ Modeling congestion and service time in hub location problems ⋮ Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem ⋮ Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs ⋮ Aggregation error for location models: Survey and analysis ⋮ An efficient heuristic for a hub location routing problem ⋮ Allocating nodes to hubs for minimizing the hubs processing resources: A case study
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Adapting polyhedral properties from facility to hub location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- New formulations for the uncapacitated multiple allocation hub location problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Optimal design of a distributed network with a two-level hierarchical structure
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- On the single-assignment \(p\)-hub center problem
- Network cost minimization using threshold-based discounting
- Network hub location problems: The state of the art
- The Latest Arrival Hub Location Problem
- Hub Arc Location Problems: Part I—Introduction and Results
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
This page was built for publication: Uncapacitated single and multiple allocation \(p\)-hub center problems
