Dual-based approach for a hub network design problem under non-restrictive policy
From MaRDI portal
Publication:5938396
DOI10.1016/S0377-2217(00)00114-4zbMath0991.90023OpenAlexW2039426912WikidataQ126400420 ScholiaQ126400420MaRDI QIDQ5938396
No author found.
Publication date: 18 July 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00114-4
Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (10)
An exact solution procedure for a cluster hub location problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ Allocation strategies in hub networks ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Network hub location problems: The state of the art ⋮ Flow shipment scheduling in an incomplete hub location-routing network design problem ⋮ Modeling congestion and service time in hub location problems ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
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
- A linear program for the two-hub location problem
- Design of a distributed finer transport network with hubbing topology
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- A dual ascent approach for steiner tree problems on a directed graph
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
- Dual-ascent methods for large-scale multicommodity flow problems
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Lower Bounds for the Hub Location Problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
This page was built for publication: Dual-based approach for a hub network design problem under non-restrictive policy
