Methods for combinatorial optimization -With examples (Paperback) (ISBN-13: 9786200046376)

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..

Author: Omar Selt
ISBN-10: 6200046379
ISBN-13: 9786200046376
Publisher: Noor Publishing
Language: English
Published: 08/22/2025
Pages: 52
Format: Paperback
Weight: 0.18lbs
Size: 9.00h x 6.00w x 0.12d