A reliable affine relaxation method for global optimization
Year of publication: |
2015
|
---|---|
Authors: | Ninin, Jordan ; Messine, Frédéric ; Hansen, Pierre |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 13.2015, 3, p. 247-277
|
Subject: | Affine arithmetic | Interval analysis | Linear relaxation | Branch and bound algorithm | Global optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach
Derval, Guillaume, (2022)
-
A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem
Chen, Yuning, (2014)
-
Cross entropy for multiobjective combinatorial optimization problems with linear relaxations
Caballero, Rafael, (2015)
- More ...
-
Ninin, Jordan, (2011)
-
Ninin, Jordan, (2011)
-
The small hexagon and heptagon with maximum sum of distances between vertices
Audet, Charles, (2011)
- More ...