Lagrangean relaxation for the capacitated hub location problem with single assignment
From MaRDI portal
Publication:1027993
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.
Cites work
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- A branch and cut algorithm for hub location problems with single assignment
- A quadratic integer program for the location of interacting hub facilities
- An efficient procedure for designing single allocation hub and spoke systems
- Capacitated single allocation hub location problem-A bi-criteria approach
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub arc location problems: I. Introduction and results
- Integer programming formulations of discrete hub location problems
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Network cost minimization using threshold-based discounting
- Network hub location problems: The state of the art
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- New trends in exact algorithms for the \(0-1\) knapsack problem
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Preprocessing and cutting for multiple allocation hub location problems.
- Solution algorithms for the capacitated single allocation hub location problem
- Solving a capacitated hub location problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
Cited in
(32)- Proprietor and customer costs in the incomplete hub location-routing network topology
- Single-allocation ordered median hub location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- Stochastic hub location problems with Bernoulli demands
- The tree of hubs location problem
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- Perspectives on modeling hub location problems
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- The hub location problem with market selection
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- An exact algorithm for the modular hub location problem with single assignments
- Lagrangean relaxation-based techniques for solving facility location problems
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Machine learning augmented approaches for hub location problems
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Branch and price for large-scale capacitated hub location problems with single assignment
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Lower bounding procedures for the single allocation hub location problem
- A Lagrangian relaxation approach for expansion of a highway network
- General network design: a unified view of combined location and network design problems
- HUBBI: iterative network design for incomplete hub location problems
- Tight bounds from a path based formulation for the tree of hub location problem
- A fuzzy programming approach for dynamic virtual hub location problem
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)
