€ 24,90 Gratis verzending
Methods for combinatorial optimization With examples
Prijzen vanaf
24,90
Gesponsorde links
|
|
24,90 |
Naar shop
|
|
27,99 |
Naar shop
|
| VERGELIJK ALLE AANBIEDERS (2) | ||
Beschrijving
Bol
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..
Vergelijk aanbieders (2)
Gesponsorde links · Sommige shops betalen ons een vergoeding
Sorteren op:
€ 27,99 Gratis verzending
Winkels met andere maten
Beschrijving
(1)
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..
Productspecificaties
Prijshistorie
* Prijshistorie bevat geen data van Amazon.
Prijzen voor het laatst bijgewerkt op:
Gerelateerde resultaten
Uitgelichte Keuze
24,90
