Lagrangean relaxation-based techniques for solving facility location problems

DOI10.1007/978-1-4419-7572-0_17MaRDI QIDQ5506732zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1253042
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• Lagrangean relaxation. (With comments and rejoinder).

Cites work

• 'Multidimensional' extensions and a nested dual approach for the m-median problem
• A branch-and-price approach to p-median location problems
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• A comparison of two dual-based procedures for solving the p-median problem
• A computational evaluation of two subgradient search methods
• A dual algorithm for the uncapacitated hub location problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Bounded Algorithm for the p-Median Problem
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A Lagrangean dual ascent algorithm for simple plant location problems
• A maximal covering location model in the presence of partial coverage
• A method for solving to optimality uncapacitated location problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• A tree search algorithm for the p-median problem
• Accelerating the convergence of subgradient optimisation
• An Analysis of Private and Public Sector Location Models
• An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
• Conditional subgradient optimization -- theory and applications
• Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
• Dual-based approach for a hub network design problem under non-restrictive policy
• Dual-based heuristics for a hierarchical covering location problem
• Efficient algorithms for the capacitated concentrator location problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• HubLocator: An exact solution method for the multiple allocation hub location problem
• Integer programming formulations of discrete hub location problems
• Lagrangean heuristics for location problems
• On the choice of step size in subgradient optimization
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Polyhedral analysis and decompositions for capacitated plant location-type problems
• Technical Note—An Algorithm for the p-Median Problem
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Upper and lower bounds for the single source capacitated location problem.
• Validation of subgradient optimization

Cited in

(14)

• Applying Lagrangian relaxation to the resolution of two-stage location problems
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• An improved Lagrangian relaxation and dual ascent approach to facility location problems
• Lagrangian relaxation of the generic materials and operations planning model
• A heuristic for BILP problems: the single source capacitated facility location problem
• Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
• scientific article; zbMATH DE number 1253042 (Why is no real title available?)
• Relajacion lagrangeana para el problema de particionamiento de áreas geográficas
• scientific article; zbMATH DE number 5066625 (Why is no real title available?)
• An augmented Lagrangian decomposition method for the single-source capacitated facility location problem
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• The use of state space relaxation for the dynamic facility location problem

This page was built for publication: Lagrangean relaxation-based techniques for solving facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506732)