• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems

Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems

Hardcover

AlgebraGeneral ComputersGeneral Mathematics

ISBN10: 9811999511
ISBN13: 9789811999512
Publisher: Springer Nature
Published: Mar 28 2023
Pages: 221
Weight: 1.16
Height: 0.63 Width: 6.14 Depth: 9.21
Language: English

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution.

Also in

General Computers