Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem''
type: Item
instance of: scholarly article
title: Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem''
zbMATH Open document ID: 0858.90086
DOI: 10.1016/0167-6377(95)00052-6
author: Martine Labbé
author: S. Louis Hakimi
author: E. Schmeichel
published in: Operations Research Letters
publication date: 1996-08-01T00:00:00Z
review text: Corrections and comments to a previous paper of the authors [Oper. Res. Lett. 15, 115-126 (1994; Zbl 0810.90086)].
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 912535
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00052-6
OpenAlex ID: W2066433855
cites work: Q3123417
cites work: Improving the complexities of approximation algorithms for optimization problems
cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
cites work: Approximation Schemes for the Restricted Shortest Path Problem
Recommended article: Approximation algorithms for the capacitated plant allocation problem
Recommended article: Erratum to: The capacitated max \(k\)-cut problem
Recommended article: Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem''
Recommended article: Erratum to: Constrained partitioning problems
Recommended article: Erratum: A correction to ''Parallel approximation algorithms by positive linear programming''
Recommended article: A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
Recommended article: Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem''
Recommended article: Erratum to: ``Computational complexity of stochastic programming problems''
Recommended article: Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
Recommended article: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
description: scientific article; zbMATH DE number 912535