A computational comparison of some branch and bound methods for indefinite quadratic programs
Year of publication: |
2008
|
---|---|
Authors: | Cambini, Riccardo ; Sodini, Claudio |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 16.2008, 2, p. 139-152
|
Subject: | Branch-and-Bound | Branch and Bound | Dekompositionsverfahren | Decomposition method | Operations Research | Operations research |
-
An improved Benders decomposition applied to a multi-layer network design problem
Fortz, B., (2009)
-
Combinatorial Benders' cuts for the strip packing problem
Côté, Jean-François, (2014)
-
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
Parragh, Sophie N., (2022)
- More ...
-
Global optimization of a rank-two nonconvex program
Cambini, Riccardo, (2010)
-
Cambini, Riccardo, (2010)
-
A sequential method for a class of box constrained quadratic programming problems
Cambini, Riccardo, (2008)
- More ...