|
221 |
Branch and cut for an SDP relaxation of large scale minimum bisection problems Armbruster, Michael. - Saarbrücken : VDM Verlag Dr. Müller, 2008
|
|
|
222 |
CNM - a convergent method of Nelder and Mead type Witzel, Alexandra. - Aachen : Shaker, 2008
|
|
|
223 |
Combinatorial optimization Korte, Bernhard. - Berlin : Springer, 2008, 4. ed.
|
|
|
224 |
Combinatorial optimization and applications Berlin : Springer, 2008
|
|
|
225 |
Combinatorial solutions for shape optimization in computer vision Schoenemann, Thomas, 2008
|
|
|
226 |
Discrete optimization with interval data Kasperski, Adam. - Berlin : Springer, 2008
|
|
|
227 |
Ein Verfahren zur Dekomposition mehrstufiger stochastischer Optimierungsprobleme mit Ganzzahligkeit und Risikoaversion Heinze, Thomas, 2008
|
|
|
228 |
Evolutionary computation in combinatorial optimization Berlin : Springer, 2008
|
|
|
229 |
Global optimization methods based on tabu search Stepanenko, Svetlana, 2008
|
|
|
230 |
Graphs, networks and algorithms Jungnickel, Dieter. - Berlin : Springer, 2008, 3. ed.
|
|