139,99 €
139,99 €
inkl. MwSt.
Sofort per Download lieferbar
payback
0 °P sammeln
139,99 €
139,99 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
0 °P sammeln
Als Download kaufen
139,99 €
inkl. MwSt.
Sofort per Download lieferbar
payback
0 °P sammeln
Jetzt verschenken
139,99 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
0 °P sammeln
  • Format: PDF

Constrained optimization is a challenging branch of operations research that aims to create a model which has a wide range of applications in the supply chain, telecommunications and medical fields. As the problem structure is split into two main components, the objective is to accomplish the feasible set framed by the system constraints. The aim of this book is expose optimization problems that can be expressed as graphs, by detailing, for each studied problem, the set of nodes and the set of edges. This graph modeling is an incentive for designing a platform that integrates all optimization…mehr

Produktbeschreibung
Constrained optimization is a challenging branch of operations research that aims to create a model which has a wide range of applications in the supply chain, telecommunications and medical fields. As the problem structure is split into two main components, the objective is to accomplish the feasible set framed by the system constraints. The aim of this book is expose optimization problems that can be expressed as graphs, by detailing, for each studied problem, the set of nodes and the set of edges. This graph modeling is an incentive for designing a platform that integrates all optimization components in order to output the best solution regarding the parameters' tuning. The authors propose in their analysis, for optimization problems, to provide their graphical modeling and mathematical formulation and expose some of their variants. As a solution approaches, an optimizer can be the most promising direction for limited-size instances. For large problem instances, approximate algorithms are the most appropriate way for generating high quality solutions. The authors thus propose, for each studied problem, a greedy algorithm as a problem-specific heuristic and a genetic algorithm as a metaheuristic.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Saoussen Krichen, LARODEC Laboratory and Faculty of Law, Economics and Management, University of Jendouba, Tunisia. Jouhaina Chaouachi, IHEC Carthage, Tunisia.