Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints
Year of publication: |
2012
|
---|---|
Authors: | Ahlatçiolu, Aykut ; Bussieck, Michael ; Esen, Mustafa ; Guignard-Spielberg, Monique ; Jagla, Jan-Hendrick |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 199.2012, p. 33-49
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
-
Eirinakis, Pavlos, (2024)
-
A hybrid ANN-MILP model for agile recovery production planning for PPE products under sharp demands
Babazadeh, Reza, (2025)
- More ...
-
Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints
Ahlatçıoğlu, Aykut, (2012)
-
Term-end exam scheduling at United States Military Academy/West Point
Wang, Siqun, (2010)
-
A Lagrangean dual ascent algorithm for simple plant location problems
Guignard-Spielberg, Monique, (1988)
- More ...