Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem

DOI10.1016/0167-6377(95)00052-6MaRDI QIDQ1919191zbMATH OpenOpenAlexFDO

Authors Martine Labbé, S. Louis Hakimi, E. Schmeichel

Publication date 1 August 1996

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(95)00052-6

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27) Dynamic programming (90C39)

Review text

Corrections and comments to a previous paper of the authors [Oper. Res. Lett. 15, 115-126 (1994; Zbl 0810.90086)].

Recommendations

• Approximation algorithms for the capacitated plant allocation problem
• Erratum to: The capacitated max k-cut problem
• Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
• Erratum to: Constrained partitioning problems
• Erratum: A correction to Parallel approximation algorithms by positive linear programming
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
• Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem
• Erratum to: ``Computational complexity of stochastic programming problems
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem

Cites work

• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• Approximation Schemes for the Restricted Shortest Path Problem
• scientific article; zbMATH DE number 988191 (Why is no real title available?)
• Improving the complexities of approximation algorithms for optimization problems

Cited in

(3)

• Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
• Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem

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