A Study of Heuristic Algorithm.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
The authors study a simplified version of the knapsak problem for which both exact algorithms and heuristic algorithms are known. A necessary and sufficient condition for the validity of the heuristic algorithm is derived. Also a simple sufficient condition is derived. Author
- Operations Research