Polynomial algorithms of rectangular cutting - Marat Arslanov
-25% koodilla BOOKS
Toimitus 12-18 arkipäivässä
30 päivän palautusoikeus
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 prob ... Täydellinen kuvaus
Saatat myös pitää
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Marat Arslanov |
|---|---|
| Julkaisija | LAP Lambert Academic Publishing |
| Julkaisuvuosi | 2017 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9783330087743 |