Predicting the solution time of branch-and-bound algorithms for mixed-integer programs
Year of publication: |
2011
|
---|---|
Authors: | Özaltın, Osman Y. ; Hunsaker, Brady ; Schaefer, Andrew J. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 23.2011, 3, p. 392-403
|
Subject: | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Prognoseverfahren | Forecasting model |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
Kong, Nan, (2010)
-
Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
Özaltin, Osman Y., (2011)
-
Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
Kong, Nan, (2010)
- More ...