Conflict analysis for MINLP
Year of publication: |
2021
|
---|---|
Authors: | Berthold, Timo ; Witzig, Jakob |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 2, p. 421-435
|
Subject: | mixed integer nonlinear programming | infeasibility analysis | conflict analysis | branch-and-bound | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Operations Research | Operations research |
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
- More ...
-
Conflict-driven heuristics for mixed integer programming
Witzig, Jakob, (2021)
-
Heuristics of the branch-cut-and-price-framework SCIP
Berthold, Timo, (2008)
-
Measuring the impact of primal heuristics
Berthold, Timo, (2013)
- More ...