Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: dcs=519.6*
im Bestand: Gesamter Bestand

211 - 220 von 418

	211	A graphical approach for solving NP-hard combinatorial problems Lazarev, Aleksandr A.. - Magdeburg : Univ., Fak. für Mathematik, 2008
	212	Adaptive and multilevel metaheuristics Berlin : Springer, 2008
	213	Adaptive investement strategies for different scenarios Navarro-Barrientos, Jesús Emeterio, 2008
	214	Advances in differential evolution Berlin : Springer, 2008
	215	Advances in metaheuristics for hard optimization Berlin : Springer, 2008
	216	Annulus and center location problems Gluchshenko, Olga N., 2008
	217	Approximation algorithms for packing and scheduling problems Thöle, Ralf, 2008
	218	Approximation, randomization, and combinatorial optimization Berlin : Springer, 2008
	219	Approximative Algorithmen und Nichtapproximierbarkeit Jansen, Klaus. - Berlin : de Gruyter, 2008
	220	Benefits and drawbacks for the use of ε-dominance [epsilon-dominance] in evolutionary multi-objective optimization Horoba, Christian. - Dortmund : Secretary of the SFB 531, 2008