Comparison of some bin packing heuristics /

One of the most interesting subjects in the area of algorithms is a class of problems called the "NP-complete" problems. The status of NP-complete problems is still unknown. If any of the NP-complete problems can be solved in polynomial time, every NP-complete problem can be solved in po...

Full description

Bibliographic Details

Main Author:	Blach, Beata Bozena
Format:	Thesis eBook
Language:	English
Published:	[Place of publication not identified] : [publisher not identified] ; 1993.
Subjects:	Major computer science.
Online Access:	Link to OAKTrust copy