Jochen Gorski Multiple Objective Optimization and Implications for Single Objective Optimization ISBN: 978-3-8322-9589-9 Prijs: 49,80 € / 99,60 SFR |
|
This thesis deals with multiple objective optimization problems. The first chapter of Part I deals with the question of how multiple objective solution approaches can be used to solve single objective combinatorial optimization problems. The author concentrates on constrained versions of single objective problems as well as on algebraic sum problems. The remaining chapters of Part I are dedicated to the connectedness of the efficient set of multiple objective combinatorial optimization problems. The author focuses on problems with sum objectives and bottleneck objectives. Single objective knapsack problems with binary weights and biobjective matroid problems with binary costs are considered. Part II is devoted to biconvex minimization and biconvex maximization problems. Special attention is given to the connection location-allocation problem in the plane. Svetlana A. Kravchenko (Minsk) | |
Bron: Zentralblatt MATH 1214 | 1 | |
verder naar publicatie ... |