- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Preprints aus dem Institut für Mathematik ; 7
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2002
- Urheber
- DOI
-
10.18452/2620
- URN
-
urn:nbn:de:kobv:11-10052548
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
22.10.0001, 01:51 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Nowak, Ivo
- Humboldt-Universität zu Berlin
Entstanden
- 2002
Ähnliche Objekte (12)
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Integer and Mixed-Integer Reformulations of Stochastic, Resource-Constrained, and Quadratic Matching Problems
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Time-Domain Decomposition for Mixed-Integer Optimal Control Problems
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Author Correction: Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Integer and Mixed-Integer Reformulations of Stochastic, Resource-Constrained, and Quadratic Matching Problems
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Time-Domain Decomposition for Mixed-Integer Optimal Control Problems
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Author Correction: Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Integer and Mixed-Integer Reformulations of Stochastic, Resource-Constrained, and Quadratic Matching Problems
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Time-Domain Decomposition for Mixed-Integer Optimal Control Problems
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Author Correction: Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments