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

Descripció completa

Dades bibliogràfiques

Autor principal:	Arthanari, Tirukkattuppalli Subramanyam (Autor)
Autor corporatiu:	SpringerLink (Online service)
Format:	Electrònic eBook
Idioma:	anglès
Publicat:	Singapore : Springer Nature Singapore : Imprint: Springer, 2023.
Edició:	1st ed. 2023.
Matèries:	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.
Accés en línia:	https://doi.org/10.1007/978-981-19-9952-9
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!