Methods for combinatorial optimization -With examples

By Omar Selt

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

• Format: Paperback
• Language: English
• ISBN: 6200046379
• ISBN13: 9786200046376
• Release Date: August 2025
• Publisher: Noor Publishing
• Length: 52 Pages
• Weight: 0.18 lbs.
• Dimensions: 0.1" x 6.0" x 9.0"