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

DOI10.1016/0377-2217(91)90091-9zbMath0734.90044OpenAlexW2007393558MaRDI QIDQ811344

Jaime Barcelo, Kurt O. Jørnsten, Elena Fernández

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

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

Related Items (21)

Dynamic supply chain design with inventory ⋮ Unnamed Item ⋮ The capacitated plant location problem ⋮ The value of the multi-period solution revisited: when to model time in capacitated location problems ⋮ Locating Satellite Yards in Forestry Operations ⋮ A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. ⋮ A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem ⋮ Upper and lower bounds for the single source capacitated location problem. ⋮ Scatter search for the single source capacitated facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ The capacity and distance constrained plant location problem ⋮ A capacitated facility location problem with constrained backlogging probabilities ⋮ Capacitated facility location problem with general setup cost ⋮ On the capacitated concentrator location problem: a reformulation by discretization ⋮ Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing ⋮ A multiperiod two-echelon multicommodity capacitated plant location problem ⋮ Some personal views on the current state and the future of locational analysis ⋮ The return plant location problem: Modelling and resolution ⋮ 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 ⋮ \(\gamma\)-robust facility relocation problem

Cites Work

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

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