Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem

DOI10.1016/0377-2217(91)90091-9MaRDI QIDQ811344zbMATH OpenOpenAlexFDO

Authors Jaime Barcelo, Elena Fernández, Kurt Jörnsten

Publication date 1991

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(91)90091-9

zbMATH Keywords

heuristicsrelaxationauxiliary variablescapacitated plant locationvariable splitting approach

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• A heuristic lagrangean algorithm for the capacitated plant location problem
• The capacitated plant location problem
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• A comparison of heuristics and relaxations for the capacitated plant location problem

Cites work

• scientific article; zbMATH DE number 3765539 (Why is no real title available?)
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A direct dual method for the mixed plant location problem with some side constraints
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A partial dual algorithm for the capacitated warehouse location problem
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Dynamic programming algorithms for the zero-one knapsack problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• On the choice of step size in subgradient optimization
• The simple plant location problem: Survey and synthesis

Cited in

(29)

• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• Add/drop procedures for the capacitated plant location problem
• Capacitated facility location problem with general setup cost
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• The return plant location problem: Modelling and resolution
• Scatter search for the single source capacitated facility location problem
• Locating Satellite Yards in Forestry Operations
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
• \(\gamma\)-robust facility relocation problem
• scientific article; zbMATH DE number 4164539 (Why is no real title available?)
• scientific article; zbMATH DE number 4095174 (Why is no real title available?)
• The value of the multi-period solution revisited: when to model time in capacitated location problems
• Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
• Some personal views on the current state and the future of locational analysis
• Upper and lower bounds for the single source capacitated location problem.
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
• The capacity and distance constrained plant location problem
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• A capacitated facility location problem with constrained backlogging probabilities
• A multiperiod two-echelon multicommodity capacitated plant location problem
• The capacitated plant location problem
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• On the capacitated concentrator location problem: a reformulation by discretization
• Dynamic supply chain design with inventory

This page was built for publication: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem

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