Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems - Couverture souple

Diaby, Moustapha

 
9789814704878: Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems
Couverture souple
ISBN 10 : 9814704873 ISBN 13 : 9789814704878
Editeur : Wspc, 2016

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Wspc
Date d'édition
2016
Langue
anglais
ISBN 10 
9814704873
ISBN 13 
9789814704878
Reliure
Broché
Nombre de pages
220
Coordonnées du fabricant
non disponible
Personne responsable
non disponible