Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded
Year of publication: |
2021
|
---|---|
Authors: | Mistry, Miten ; Letsios, Dimitrios ; Krennrich, Gerhard ; Lee, Robert M. ; Misener, Ruth |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1103-1119
|
Subject: | gradient-boosted trees | branch-and-bound | mixed-integer convex programming | decomposition | catalysis | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Nichtlineare Optimierung | Nonlinear programming |
-
Bounded branch and bound method for mixed integer nonlinear programming problems
Akoka, Jacob, (1977)
-
FiberSCIP : a shared memory parallelization of SCIP
Shinano, Yuji, (2018)
-
Christensen, Tue Rauff Lind, (2021)
- More ...
-
Exact lexicographic scheduling and approximate rescheduling
Letsios, Dimitrios, (2021)
-
Approximate and robust bounded job start scheduling for Royal Mail delivery offices
Letsios, Dimitrios, (2021)
-
On multiprocessor temperature-aware scheduling problems
Bampis, Evripidis, (2013)
- More ...