Andere Kunden interessierten sich auch für
![Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory]( "Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory")
Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory27,25 €![Cake Cutting Algorithms]( "Cake Cutting Algorithms")
Cake Cutting Algorithms260,99 €![El uso didáctico y metodológico del Geoplano Rectangular]( "El uso didáctico y metodológico del Geoplano Rectangular")
El uso didáctico y metodológico del Geoplano Rectangular47,95 €![The Use of Parallel Polynomial Preconditioners]( "The Use of Parallel Polynomial Preconditioners")
The Use of Parallel Polynomial Preconditioners52,99 €![Introduction to the Theory of Weighted Polynomial Approximation]( "Introduction to the Theory of Weighted Polynomial Approximation")
Introduction to the Theory of Weighted Polynomial Approximation108,99 €![Combinatorics Advances]( "Combinatorics Advances")
Combinatorics Advances119,99 €![Polynomial Optimization Methods]( "Polynomial Optimization Methods")
Polynomial Optimization Methods24,99 €
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.