Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
From MaRDI portal
Publication:5506732
DOI10.1007/978-1-4419-7572-0_17zbMath1388.90066OpenAlexW979859694MaRDI QIDQ5506732
Vladimir Marianov, Roberto Diéguez Galvão
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_17
Related Items (3)
A heuristic for BILP problems: the single source capacitated facility location problem ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Lagrangian relaxation of the generic materials and operations planning model
Cites Work
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A Lagrangean dual ascent algorithm for simple plant location problems
- A method for solving to optimality uncapacitated location problems
- A comparison of two dual-based procedures for solving the p-median problem
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Efficient algorithms for the capacitated concentrator location problem
- A computational evaluation of two subgradient search methods
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- On the choice of step size in subgradient optimization
- A tree search algorithm for the p-median problem
- Conditional subgradient optimization -- theory and applications
- Integer programming formulations of discrete hub location problems
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- Upper and lower bounds for the single source capacitated location problem.
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A branch-and-price approach to \(p\)-median location problems
- Lagrangean heuristics for location problems
- Accelerating the convergence of subgradient optimisation
- Dual-based heuristics for a hierarchical covering location problem
- A maximal covering location model in the presence of partial coverage
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Bounded Algorithm for the p-Median Problem
- An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Technical Note—An Algorithm for the p-Median Problem
- A Survey of Lagrangean Techniques for Discrete Optimization
- A dual algorithm for the uncapacitated hub location problem
- Validation of subgradient optimization
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Analysis of Private and Public Sector Location Models
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Dual-based approach for a hub network design problem under non-restrictive policy
- HubLocator: An exact solution method for the multiple allocation hub location problem
This page was built for publication: Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
