LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs
Year of publication: |
2008
|
---|---|
Authors: | Nowak, Ivo ; Vigerske, Stefan |
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. 127-138
|
Subject: | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Operations Research | Operations research |
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
Toksari, M. Duran, (2016)
-
Exact solution of hub network design problems with profits
Alibeyg, Armaghan, (2018)
- More ...
-
Adaptive discretization of convex multistage stochastic programs
Vigerske, Stefan, (2007)
-
Adaptive discretization of convex multistage stochastic programs
Vigerske, Stefan, (2007)
-
Adaptive discretization of convex multistage stochastic programs
Vigerske, Stefan, (2007)
- More ...