Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Local search of orthogonal packings using the lower bounds
Automation and Remote Control
Hi-index | 0.00 |
The integer round-up property of the linear cutting stock problem is investigated. An algorithm for verifying the sufficient conditions under which the problem has no integer round-up property is designed.