Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
From MaRDI portal
Publication:1278346
DOI10.1016/0377-2217(95)00100-XzbMath0947.90602OpenAlexW2015462215MaRDI QIDQ1278346
Darko Skorin-Kapov, Jadranka Skorin-Kapov, Morton E. O'Kelly
Publication date: 22 April 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00100-x
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (only showing first 100 items - show all)
New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Projecting the flow variables for hub location problems ⋮ New complexity results for the \(p\)-hub median problem ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Tight bounds from a path based formulation for the tree of hub location problem ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ The planar multifacility collection depots location problem ⋮ A cost allocation problem arising in hub-spoke network systems ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ A survey of variants and extensions of the location-routing problem ⋮ The hub location and pricing problem ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ The \(q\)-ad hoc hub location problem for multi-modal networks ⋮ Hub location under competition ⋮ A compact linearisation of Euclidean single allocation hub location problems ⋮ Lower bounding procedures for the single allocation hub location problem ⋮ Solving a capacitated hub location problem ⋮ The \(p\)-hub center allocation problem ⋮ Formulating and solving splittable capacitated multiple allocation hub location problems ⋮ Solving the hub location problem with modular link capacities ⋮ Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ A molecular structure matching problem ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ \(p\)-hub median problem for non-complete networks ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ An exact solution procedure for a cluster hub location problem ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique ⋮ A hub location problem with fully interconnected backbone and access networks ⋮ The single allocation problem in the interacting three-hub network ⋮ General network design: a unified view of combined location and network design problems ⋮ New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem ⋮ Design of intermodal logistics networks with hub delays ⋮ A non-triangular hub location problem ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Allocation strategies in hub networks ⋮ An improved algorithm for fixed-hub single allocation problems ⋮ Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ An implicit enumeration algorithm for the hub interdiction median problem with fortification ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ An improved linearization technique for a class of quadratic 0-1 programming problems ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Hub location-allocation in intermodal logistic networks ⋮ A fuzzy programming approach for dynamic virtual hub location 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 ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Routing traffic at hub facilities ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ Solving the uncapacitated hub location problem using genetic algorithms ⋮ A branch and cut algorithm for hub location problems with single assignment ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ The capacitated single-allocation hub location problem revisited: a note on a classical formulation ⋮ Stochastic single-allocation hub location ⋮ Alternate solution approaches for competitive hub location problems ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Perspectives on modeling hub location problems ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Stochastic air freight hub location and flight routes planning ⋮ Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem ⋮ New formulations and solution procedures for the hop constrained network design problem. ⋮ Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ A linear program for the two-hub location problem ⋮ A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor ⋮ The tree of hubs location problem ⋮ Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem ⋮ The capacitated multiple allocation hub location problem: Formulations and algorithms ⋮ On the single-assignment \(p\)-hub center problem ⋮ Efficient solution procedure and reduced size formulations for \(p\)-hub location problems ⋮ Location of hubs in a competitive environment ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Network cost minimization using threshold-based discounting ⋮ Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm ⋮ A hybrid heuristic for the uncapacitated hub location problem
Uses Software
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- On the quadratic assignment problem
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Lower Bounds for the Hub Location Problem
This page was built for publication: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
