Pedigree Polytopes
portes grátis
Pedigree Polytopes
New Insights on Computational Complexity of Combinatorial Optimisation Problems
Arthanari, Tirukkattuppalli Subramanyam
Springer Verlag, Singapore
03/2024
221
Mole
Inglês
9789811999543
15 a 20 dias
Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Combinatorial Optimization;Pedigree Polytopes;Polynomial Time Algorithms;Computational Complexity;Symmetric Traveling Salesman Problem;Combinatorial Optimisation;NP vs P;Polynomial Solvability;NP-completeness;Maximal flow problem;Polyhedral Combinatorics;Good algorithm;Efficient algorithm
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
