Strong relaxations for continuous nonlinear programs based on decision diagrams
Year of publication: |
2021
|
---|---|
Authors: | Davarnia, Danial |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 2, p. 239-245
|
Subject: | Cutting planes | Decision diagrams | Mixed integer and nonlinear programs | Outer approximation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung | Decision |
-
Target cuts from relaxed decision diagrams
Tjandraatmadja, Christian, (2019)
-
Solving unsplittable network flow problems with decision diagrams
Salemi, Hosseinali, (2023)
-
Dual bounds from decision diagram-based route relaxations : an application to truck-drone routing
Tang, Ziye, (2024)
- More ...
-
Network models with unsplittable node flows with application to unit train scheduling
Davarnia, Danial, (2019)
-
From estimation to optimization via shrinkage
Davarnia, Danial, (2017)
-
Solving a class of cut-generating linear programs via machine learning
Rajabalizadeh, Atefeh, (2024)
- More ...