0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Optimization

Buy Now

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems (Hardcover) Loot Price: R2,734
Discovery Miles 27 340
Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial...

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems (Hardcover)

Moustapha Diaby, Mark H. Karwan

 (sign in to rate)
Loot Price R2,734 Discovery Miles 27 340 | Repayment Terms: R256 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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.

General

Imprint: World Scientific Publishing Co Pte Ltd
Country of origin: Singapore
Release date: April 2016
Authors: Moustapha Diaby • Mark H. Karwan
Dimensions: 238 x 159 x 21mm (L x W x T)
Format: Hardcover - Cloth over boards
Pages: 220
ISBN-13: 978-981-4704-87-8
Categories: Books > Science & Mathematics > Mathematics > Optimization > General
LSN: 981-4704-87-3
Barcode: 9789814704878

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners