Lagrangean relaxation for the capacitated hub location problem with single assignment
From MaRDI portal
Publication:1027993
DOI10.1007/S00291-008-0159-YzbMATH Open1163.90617OpenAlexW2071259461MaRDI QIDQ1027993FDOQ1027993
Ivan Contreras, Elena Fernández, Juan A. Díaz
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
Recommendations
- Lower bounding procedures for the single allocation hub location problem
- Branch and price for large-scale capacitated hub location problems with single assignment
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Upper and lower bounds for the single source capacitated location problem.
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- Preprocessing and cutting for multiple allocation 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
- Solution algorithms for the capacitated single allocation hub location problem
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A branch and cut algorithm for hub location problems with single assignment
- Lagrangean relaxation. (With comments and rejoinder).
- Formulating and solving splittable capacitated multiple allocation hub location problems
- 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
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Solving a capacitated hub location problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Network cost minimization using threshold-based discounting
Cited In (26)
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- The tree of hubs location problem
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Single-allocation ordered median hub location problems
- General network design: a unified view of combined location and network design problems
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- An exact algorithm for the modular hub location problem with single assignments
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Stochastic hub location problems with Bernoulli demands
- Proprietor and customer costs in the incomplete hub location-routing network topology
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Machine learning augmented approaches for hub location problems
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- A Lagrangian relaxation approach for expansion of a highway network
- HUBBI: iterative network design for incomplete hub location problems
- Perspectives on modeling hub location problems
- A fuzzy programming approach for dynamic virtual hub location problem
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
This page was built for publication: Lagrangean relaxation for the capacitated hub location problem with single assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027993)
