Polynomial algorithms of rectangular cutting

About The Book

The problems of guillotine rectangular cutting allow pseudo polynomial algorithms for their solution. Intuitive reflection by analogy with integer linear programming lead up to the hypothesis about an existence of a polynomial algorithm for the problem of optimum guillotine cutting of the rectangle into fixed kinds of small rectangles. In this monograph this hypothesis is justified for a few classes of problems.
Piracy-free
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
downArrow

Details


LOOKING TO PLACE A BULK ORDER?CLICK HERE