{ "item_title" : "Methods for combinatorial optimization -With examples", "item_author" : [" Omar Selt "], "item_description" : "A combinatorial optimization problem consists of finding the minimum s of a function f (economic functions), with real or integer variable on a finite set S, the elements of S verifying certain Optimization is choosing an efficient method capable of producing an optimal solution in a reasonablecomputational time. The different resolution methods developed can be classified into two categories: exact methods which guarantee the completeness of the resolution and approximate methods which lose completeness to gain efficiency. constraints are called feasible solutions; among which, the optimal solution is included..", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/6/20/004/637/6200046379_b.jpg", "price_data" : { "retail_price" : "29.00", "online_price" : "29.00", "our_price" : "29.00", "club_price" : "29.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details