Lagrangean relaxation for the capacitated hub location problem with single assignment
From MaRDI portal
Publication:1027993
DOI10.1007/s00291-008-0159-yzbMath1163.90617OpenAlexW2071259461MaRDI QIDQ1027993
Elena Fernández, Juan A. Díaz, Iván A. Contreras
Publication date: 30 June 2009
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-008-0159-y
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Stochastic hub location problems with Bernoulli demands ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ General network design: a unified view of combined location and network design problems ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Machine learning augmented approaches for hub location problems ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Hub and spoke network design with single-assignment, capacity decisions and balancing requirements ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Single-allocation ordered median hub location problems ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ The capacitated single-allocation hub location problem revisited: a note on a classical formulation ⋮ Perspectives on modeling hub location problems ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor ⋮ The tree of hubs location problem
Cites Work
- Unnamed Item
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Preprocessing and cutting for multiple allocation hub location problems.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Network cost minimization using threshold-based discounting
- A branch and cut algorithm for hub location problems with single assignment
- Lagrangean relaxation. (With comments and rejoinder).
- Solving a capacitated hub location problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
