Recently Viewed

New

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems by Mark H. Karwan 9789814704878

No reviews yet Write a Review
RRP: £88.00
Booksplease Price: £77.16
Booksplease saves you 12%

  Bookmarks: Included free with every order
  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When You Buy 3 or More Books - Use code: FREEUKDELIVERY in your cart!

SKU:
9789814704878
MPN:
9789814704878
Available from Booksplease!
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Global delivery available
Availability: Usually dispatched within 3 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

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.

Book Information
ISBN 9789814704878
Author Mark H. Karwan
Format Hardback
Page Count 220
Imprint World Scientific Publishing Co Pte Ltd
Publisher World Scientific Publishing Co Pte Ltd

Reviews

No reviews yet Write a Review

Booksplease  Reviews