Take a photo of a barcode or cover
![Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization [With CDROM] by](http://65.108.96.136/rails/active_storage/representations/redirect/eyJfcmFpbHMiOnsibWVzc2FnZSI6IkJBaHBBMkhGZWc9PSIsImV4cCI6bnVsbCwicHVyIjoiYmxvYl9pZCJ9fQ==--91a15d0e9dee5bcba09f3446ab606a307c4a4be4/eyJfcmFpbHMiOnsibWVzc2FnZSI6IkJBaDdCem9MWm05eWJXRjBTU0lJYW5CbkJqb0dSVlE2RkhKbGMybDZaVjkwYjE5c2FXMXBkRnNIYVFJc0FXa0M5QUU9IiwiZXhwIjpudWxsLCJwdXIiOiJ2YXJpYXRpb24ifX0=--038335c90cf75c275ae4d36968ac417dc4a0a3e3/Differential%20Evolution-%20A%20Handbook%20for%20Global%20Permutation-Based%20Combinatorial%20Optimization%20%5BWith%20CDROM%5D.jpg)
211 pages • missing pub info (view editions)
ISBN/UID: 9783540921509
Format: Hardcover
Language: English
Publisher: Springer
Edition Pub Date: 13 January 2009
Description
What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e., enumerable. For example, the traveling salesman problem asks in what order a salesma...
Community Reviews
Content Warnings
![Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization [With CDROM] by](http://65.108.96.136/rails/active_storage/representations/redirect/eyJfcmFpbHMiOnsibWVzc2FnZSI6IkJBaHBBMkhGZWc9PSIsImV4cCI6bnVsbCwicHVyIjoiYmxvYl9pZCJ9fQ==--91a15d0e9dee5bcba09f3446ab606a307c4a4be4/eyJfcmFpbHMiOnsibWVzc2FnZSI6IkJBaDdCem9MWm05eWJXRjBTU0lJYW5CbkJqb0dSVlE2RkhKbGMybDZaVjkwYjE5c2FXMXBkRnNIYVFJc0FXa0M5QUU9IiwiZXhwIjpudWxsLCJwdXIiOiJ2YXJpYXRpb24ifX0=--038335c90cf75c275ae4d36968ac417dc4a0a3e3/Differential%20Evolution-%20A%20Handbook%20for%20Global%20Permutation-Based%20Combinatorial%20Optimization%20%5BWith%20CDROM%5D.jpg)
211 pages • missing pub info (view editions)
ISBN/UID: 9783540921509
Format: Hardcover
Language: English
Publisher: Springer
Edition Pub Date: 13 January 2009
Description
What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e., enumerable. For example, the traveling salesman problem asks in what order a salesma...