|
171 |
Approximative Algorithmen und Nichtapproximierbarkeit
Jansen, Klaus. - Berlin/Boston : De Gruyter, 2008
|
|
|
|
172 |
Benefits and drawbacks for the use of e-dominance in evolutionary multi-objective optimization
Horoba, Christian. - Dortmund : Universitätsbibliothek Dortmund, 2008
|
|
|
|
173 |
Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems
Armbruster, Michael. - Saarbrücken : VDM Verlag Dr. Müller, 2008
|
|
|
|
174 |
CNM – A Convergent Method of Nelder and Mead Type
Witzel, Alexandra. - Aachen : Shaker, 2008, 1. Auflage
|
|
|
|
175 |
Combinatorial optimization and applications
Berlin : Springer, 2008
|
|
|
|
176 |
Differential evolution: a handbook for global permutation-based combinatorial optimization
Berlin : Springer, [2008]
|
|
|
|
177 |
Discrete optimization with interval data
Berlin : Springer, 2008
|
|
|
|
178 |
Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
Gaffke, Norbert. - Augsburg : Universität Augsburg, 2008
|
|
|
|
179 |
Ein Verfahren zur Dekomposition mehrstufiger stochastischer Optimierungsprobleme mit Ganzzahligkeit und Risikoaversion
Heinze, Thomas, 2008
|
|
|
|
180 |
Evolutionary computation in combinatorial optimization
Berlin : Springer, 2008
|
|
Administration
