How important are branching decisions : fooling MIP solvers
Year of publication: |
2015
|
---|---|
Authors: | Le Bodic, Pierre ; Nemhauser, George L. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 3, p. 273-278
|
Subject: | Mixed integer programming solvers | Branch and bound | Tree size | Edge coloring | Chromatic index | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
Wang, Guanglei, (2019)
-
Meier, Fabian, (2017)
-
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu, (2021)
- More ...
-
Farmland allocation in the conversion from conventional to organic farming
Jahantab, Mahboubeh, (2023)
-
Kazemi, Ahmad, (2021)
-
Locomotive fuel management with inline refueling
Kazemi, Ahmad, (2021)
- More ...