Advances in Combinatorial Optimization

Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems

Nonfiction, Science & Nature, Mathematics, Combinatorics
Cover of the book Advances in Combinatorial Optimization by Moustapha Diaby, Mark H Karwan, World Scientific Publishing Company
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Moustapha Diaby, Mark H Karwan ISBN: 9789814704892
Publisher: World Scientific Publishing Company Publication: January 28, 2016
Imprint: WSPC Language: English
Author: Moustapha Diaby, Mark H Karwan
ISBN: 9789814704892
Publisher: World Scientific Publishing Company
Publication: January 28, 2016
Imprint: WSPC
Language: English

Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.

Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).

On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.

Errata(s)
Errata (267 KB)

Contents:

  • Introduction
  • Basic IP Model Using the TSP
  • Basic LP Model Using the TSP
  • Generic LP Modeling for COPs
  • Non-Symmetry of the Basic (TSP) Model
  • Non-Applicability of Extended Formulations Theory
  • Illustrations for Other NP-Complete COPs

Readership: Professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.
Key Features:

  • The book offers a new proof of the equality of the complexity classes "P" and "NP"
  • Although our approach is developed using the framework of the TSP, it has natural analogs for the other problems in the NP-Complete class thus providing a unified framework for modeling many combinatorial optimization problems (COPs)
  • The book makes a contribution to the theory and application of Extended Formulations (EFs) refining the notion of EFs by separating the case in which that notion is degenerate from the case in which the notion of EF is well defined/meaningful. It separates the case in which the addition of redundant constraints and variables (for the purpose of establishing EF relations) matters from the case in which the addition of redundant constraints and variables does not matter
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.

Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).

On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.

Errata(s)
Errata (267 KB)

Contents:

Readership: Professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.
Key Features:

More books from World Scientific Publishing Company

Cover of the book Harmonic and Spectral Analysis by Moustapha Diaby, Mark H Karwan
Cover of the book Electro-Catalysis at Chemically Modified Solid Surfaces by Moustapha Diaby, Mark H Karwan
Cover of the book Calculating Catastrophe by Moustapha Diaby, Mark H Karwan
Cover of the book Regional Development and Economic Growth in China by Moustapha Diaby, Mark H Karwan
Cover of the book Mathematical Modelling by Moustapha Diaby, Mark H Karwan
Cover of the book Computational Linguistics, Speech and Image Processing for Arabic Language by Moustapha Diaby, Mark H Karwan
Cover of the book Connections, Sprays and Finsler Structures by Moustapha Diaby, Mark H Karwan
Cover of the book The Quantum Puzzle by Moustapha Diaby, Mark H Karwan
Cover of the book 100 Years of Subatomic Physics by Moustapha Diaby, Mark H Karwan
Cover of the book The Domestic Dynamics of China's Energy Diplomacy by Moustapha Diaby, Mark H Karwan
Cover of the book Transforming Reconfigurable Systems by Moustapha Diaby, Mark H Karwan
Cover of the book Evidence-based Clinical Chinese Medicine by Moustapha Diaby, Mark H Karwan
Cover of the book Advanced Nonlinear Optics by Moustapha Diaby, Mark H Karwan
Cover of the book Univer-Cities: Strategic View of the Future by Moustapha Diaby, Mark H Karwan
Cover of the book 43 Visions for Complexity by Moustapha Diaby, Mark H Karwan
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy