Solving a class of cut-generating linear programs via machine learning
Year of publication: |
2024
|
---|---|
Authors: | Rajabalizadeh, Atefeh ; Davarnia, Danial |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 3, p. 708-722
|
Subject: | cut-generating linear programs | cutting planes | data classification | function approximation | machine learning | Mathematische Optimierung | Mathematical programming | Künstliche Intelligenz | Artificial intelligence | Theorie | Theory | Algorithmus | Algorithm |
-
Fast best subset selection : coordinate descent and local combinatorial optimization algorithms
Hazimeh, Hussein, (2020)
-
Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
Lagos, Felipe, (2024)
-
A new look at the swing contract : from linear programming to particle swarm optimization
Behrndt, Tapio, (2022)
- 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)
-
Strong relaxations for continuous nonlinear programs based on decision diagrams
Davarnia, Danial, (2021)
- More ...