Omschrijving
The focus area of this paper is on the assignment problem with budget constraints which is one of the application area of combinatorial optimization that operates on the domain of those optimization problems, in which the set of feasible solutions is discrete or can be reduced to discrete, and in which the goal is to find the best solution. It is particularly concerned with solving the unconstrained assignment problems with Hungarian algorithm and the constrained assignment problem by cutting plane or outer linearization algorithm for solving the Lagrangian dual problem in which, at each iteration, the function that approximates the dual function is optimized. The paper is divided in to two chapters. In the first chapter, the classical assignment problem, the problem of finding optimum (mi
Kenmerken
| Artikelnummer | 9200000008340575 |
|---|---|
| EAN | 9783848490356 |
| Categorie | Educational Books |
| Productgroep | Boeken |
| Segment | Textual/Printed/Reference Materials |
| Prijs Nederland | € 53,99 |
| Prijs België | € 53,99 |
| Verzendkosten NL | Gratis |
| Verzendkosten BE | Gratis |
| Levertijd Nederland | Over 30 dagen |
| Levertijd België | Over 33 dagen |
| Verkoper | Partner |
Assignment problem with budget constraints bestellen bij snelkeus
Koop Assignment problem with budget constraints van Onbekend online in de categorie Educational Books. Prijs € 53,99, levering in Nederland · Over 30 dagen.