UPC: 9783031137136 | Graduate Texts in Operations Research: Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Hardcover)

Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare
Add your review
This Post layout works only with Content Egg
Check all prices
This site contains links to affiliate websites, and we receive an affiliate commission for any purchases made by you on the affiliate website using such links including amazon associates and other affiliate programs.

Click to See Coupon Codes

  • At amazon.com you can purchase Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Graduate Texts in Operations Research) for only 0.00
  • The lowest price of Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Graduate Texts in Operations Research) was obtained on August 25, 2025 5:32 pm.
UPC: 9783031137136 | Graduate Texts in Operations Research: Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Hardcover)
UPC: 9783031137136 | Graduate Texts in Operations Research: Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Hardcover)

Description

UPC lookup results for: 9783031137136 | Graduate Texts in Operations Research: Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Hardcover)

This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle deconstructing them into a few key concepts presented in separate chapters: construction improvement decomposition randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline a kind of cloud sculpture. Moreover it provides concrete applications of the travelling salesman problem which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such even readers with a very limited background in the field will be able to follow all the content.

UPC: 9783031137136 | Graduate Texts in Operations Research: Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Hardcover) Prices

Price History

Reviews (0)

User Reviews

0.0 out of 5
0
0
0
0
0
Write a review

There are no reviews yet.

Be the first to review “UPC: 9783031137136 | Graduate Texts in Operations Research: Design of Heuristic Algorithms for Hard Optimization: With Python Codes for the Travelling Salesman Problem (Hardcover)”

ParamountMinds
Logo
Compare items
  • Total (0)
Compare
0