Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints
Year of publication: |
2012
|
---|---|
Authors: | Ahlatçıoğlu, Aykut ; Bussieck, Michael ; Esen, Mustafa ; Guignard, Monique ; Jagla, Jan-Hendrick ; Meeraus, Alexander |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 199.2012, 1, p. 33-50
|
Saved in:
Saved in favorites
Similar items by person
-
Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints
Ahlatçiolu, Aykut, (2012)
-
Term-end exam scheduling at United States Military Academy/West Point
Wang, Siqun, (2010)
-
Fast algorithms for the maximum convolution problem
Bussieck, Michael, (1994)
- More ...