Approximation algorithms for the capacitated plant allocation problem

DOI10.1016/0167-6377(94)90046-9zbMath0810.90086OpenAlexW2044548380MaRDI QIDQ1332940

S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé

Publication date: 1994

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

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90046-9

zbMATH Keywords

heuristicsfully polynomial approximation schemecapacitated plant allocation

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (4)

Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem ⋮ Nonconvex piecewise linear knapsack problems ⋮ Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem

Cites Work

• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• On a general network location--production--allocation problem
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for the capacitated plant allocation problem