서지주요정보
Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems
서명 / 저자 Pedigree Polytopes [electronic resource] : New Insights on Computational Complexity of Combinatorial Optimisation Problems / by Tirukkattuppalli Subramanyam Arthanari.
저자명 Arthanari, Tirukkattuppalli Subramanyam. author. aut http://id.loc.gov/vocabulary/relators/aut
단체명 SpringerLink (Online service)
판사항 1st ed. 2023.
발행사항 Singapore : Springer Nature Singapore : Imprint: Springer, 2023.
Online Access https://doi.org/10.1007/978-98... URL

서지기타정보

서지기타정보
ISBN 9789811999529
기타 표준번호 10.1007/978-981-19-9952-9
청구기호 QA267.7
형태사항 XXV, 221 p. 83 illus., 50 illus. in color. online resource.
언어 English
내용 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.
주제 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 .
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9789811999512 Printed edition: 9789811999536 Printed edition: 9789811999543
QR CODE