Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem

DOI10.1080/02331930108844546zbMath0993.90069OpenAlexW2117722264MaRDI QIDQ2743665

Kaj Holmberg

Publication date: 6 November 2001

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930108844546

zbMATH Keywords

Lagrange multipliersdecomposition methodssubgradient optimizationuncapacitated facility location

Mathematics Subject Classification ID

Continuous location (90B85) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Decomposition methods (49M27)

Related Items (7)

Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ On a class of subadditive duals for the uncapacitated facility location problem ⋮ An application of a Lagrangian-type relaxation for the uncapacitated facility location problem ⋮ Solving the simple plant location problem by genetic algorithm ⋮ A simple tabu search for warehouse location ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ Mean value cross decomposition for nonlinear convex problems

Cites Work

• On the convergence of cross decomposition
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A projection method for the uncapacitated facility location problem
• On the exact solution of large-scale simple plant location problems
• Partitioning procedures for solving mixed-variables programming problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• Mean value cross decomposition applied to integer programming problems
• Lagrangean heuristics for location problems
• An iterative method of solving a game
• Decomposition Principle for Linear Programs
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Primal Approach to the Simple Plant Location Problem
• A Dual-Based Procedure for Dynamic Facility Location
• A convergence proof for linear mean value cross decomposition
• Cross decomposition for mixed integer programming
• Validation of subgradient optimization
• Two-Level Planning
• Minimization of unsmooth functionals

This page was built for publication: Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem