Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

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

by Moustapha Diaby , Mark H. Karwan
Save 17% Save 17%
Current price ₹10,875.00
Original price ₹13,050.00
Original price ₹13,050.00
Original price ₹13,050.00
(-17%)
₹10,875.00
Current price ₹10,875.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9789814704878
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: World Scientific Publishing Company
  • Publisher Imprint: World Scientific Publishing Company
  • Publication Date:
  • Pages: 220
  • Original Price: USD 106.0
  • Language: English
  • Edition: N/A
  • Item Weight: 477 grams
  • BISAC Subject(s): Optimization

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us