Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
Author:
- Tsung-Chyan LaiTLTsung-Chyan Lai
- 1 November 1993
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 14 (4) , 215-220
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Worst-case analysis of the differencing method for the partition problemMathematical Programming, 1987
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981