|
271 |
Polyhedra and algorithms for the general routing problem Theis, Dirk, [2006]
|
|
|
272 |
Probleme der Tourenbildung Kämpf, Michael. - Chemnitz : Universitätsbibliothek Chemnitz, 2006
|
|
|
273 |
Scenario reduction in stochastic programming with respect to discrepancy distances Henrion, René. - Berlin : Humboldt-Universität zu Berlin, 2006
|
|
|
274 |
Scheduling unrelated parallel machines Wotzlaw, Andreas, 2006
|
|
|
275 |
Structural properties of linear probabilistic constraints Henrion, René. - Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2006
|
|
|
276 |
Takeover time in parallel populations with migration Rudolph, Günter. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
277 |
Towards a new evolutionary computation Berlin : Springer, 2006
|
|
|
278 |
When the plus strategy performs better than the comma strategy - and when not Jägersküpper, Jens. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
279 |
Why comma selection can help with the escape from local optima Jägersküpper, Jens. - Dortmund : Universitätsbibliothek Dortmund, 2006
|
|
|
280 |
Approximability of cycle covers and smoothed analysis of binary search trees Manthey, Bodo, 2005
|
|