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

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 ped...

Полное описание

Сохранить в:

Библиографические подробности
Главный автор:	Arthanari, Tirukkattuppalli Subramanyam (Автор)
Соавтор:	SpringerLink (Online service)
Формат:	Электронный ресурс eКнига
Язык:	английский
Опубликовано:	Singapore : Springer Nature Singapore : Imprint: Springer, 2023.
Редактирование:	1st ed. 2023.
Предметы:	Computational complexity. Mathematical optimization. Calculus of variations. Algebraic fields. Polynomials. Operations research. Management science. Computational Complexity. Optimization. Calculus of Variations and Optimization. Continuous Optimization. Field Theory and Polynomials. Operations Research, Management Science.
Online-ссылка:	https://doi.org/10.1007/978-981-19-9952-9
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!

Оглавление:

Chapter 1: Prologue
Chapter 2: Notations, Definitions and Briefs
Chapter 3: Motivation for Studying Pedigrees
Chapter 4: Structure of the Pedigree Polytope
Chapter 5: Membership Checking in Pedigree Polytopes
Chapter 6: Computational Complexity of Membership Checking
Chapter 7: Efficient Checking of Membership in Pedigree Polytope and its Implications
Chapter 8: Epilogue.

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

Схожие документы