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

DOI10.1016/0167-6377(95)00052-6zbMath0858.90086OpenAlexW2066433855MaRDI QIDQ1919191

Martine Labbé, S. Louis Hakimi, Edward F. 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

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

Related Items (1)

A simple efficient approximation scheme for the restricted shortest path problem

Cites Work

• Unnamed Item
• Improving the complexities of approximation algorithms for optimization problems
• Approximation Schemes for the Restricted Shortest Path Problem
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work

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