Katalog der Deutschen Nationalbibliothek

Expertensuche ?

eingeschränkt auf
- Materialarten:	Online Ressourcen

Servicezeiten in Frankfurt am Main ab 1. Dezember 2025: Montag bis Freitag 9–18 Uhr und Samstag 10–16 Uhr
Service hours in Frankfurt am Main from 1 December 2025: Monday to Friday 9:00-18:00 and Saturday 10:00-16:00

Dienstag 9. Dezember 2025: Die Lesesäle der Deutschen Nationalbibliothek in Leipzig öffnen wegen einer Personalversammlung erst ab 13 Uhr. // Tuesday 9 December 2025: The reading rooms of the German National Library in Leipzig will open at 13:00 due to a staff assembly.

Ergebnis der Suche nach: tit all "The Complexity of Optimization Problems."
im Bestand: Gesamter Bestand

1 - 5 von 5

	1	On the complexity and approximability of optimization problems with Minimum Quantity Constraints Sieber, Alexander. - Kaiserslautern : Technische Universität Kaiserslautern, 2020
	2	The complexity results of the sparse optimization problems and reverse convex optimization problems Enthalten in Optimization letters 10.2.2020: 1-12
	3	Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods Enthalten in Autonomous agents and multi-agent systems 26.6.2018: 1-38
	4	Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems Enthalten in Journal of global optimization Bd. 27, Nr. 1, date:9.2003: 83-96
	5	On the complexity of the exchange algorithm for minimax optimization problems Enthalten in Mathematical programming Bd. 38, Nr. 2, date:6.1987: 219-222