Tirukkattuppalli Subramanyam Arthanari
Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems
Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems
💎 Earn 578 Points (£5.78) on this item.
We can order this item for you. Delivery usually takes about 4 to 6 weeks.
This item is not held in our immediate stock. We will order it for you after checkout.
Estimated delivery: About 4 to 6 weeks
YOU SAVE £24.36
- Condition: Brand new
- UK Delivery times: Usually arrives within 2 - 3 working days
- UK Shipping: Fee starts at £3.89. Subject to product weight & dimension
Bulk ordering. Want 15 or more copies? Get a personalised quote and bigger discounts. Learn more about bulk orders.
Couldn't load pickup availability
- More about Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems
Format: Paperback / softback
Length: 221 pages
Publication date: 29 March 2024
Publisher: Springer Verlag, Singapore
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).
Dimension: 235 x 155 (mm)
ISBN-13: 9789811999543
Edition number: 2023 ed.
UK and International shipping information
UK and International shipping information
We deliver throughout the United Kingdom and to 128 countries and territories worldwide, including the United States, Australia, Canada, Germany, Spain and France.
