Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Philipp M. Christophel"'
Autor:
Michael Bastubbe, Marco E. Lübbecke, Ambros M. Gleixner, Jeff Linderoth, Timo Berthold, Ted K. Ralphs, Hans D. Mittelmann, Yuji Shinano, Gregor Hendel, Thorsten Koch, Kati Jarck, Gerald Gamrath, Domenico Salvagnin, Philipp M. Christophel, Derya B. Özyurt, Tobias Achterberg
Publikováno v:
Mathematical programming computation : MPC 13(3), 443-490 (2021). doi:10.1007/s12532-020-00194-3
Mathematical programming computation : MPC (2021). doi:10.1007/s12532-020-00194-3
Published by Springer, Berlin ; Heidelberg
Published by Springer, Berlin ; Heidelberg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3094d754be2146d9114ecd9f4969c1f
https://doi.org/10.1007/s12532-020-00194-3
https://doi.org/10.1007/s12532-020-00194-3
Publikováno v:
Operations Research Proceedings ISBN: 9783540325376
OR
OR
In current mixed-integer programming (MIP) solvers heuristics are used to find feasible solutions before the branch-and-bound or branchand-cut algorithm is applied to the problem. Knowing a feasible solution can improve the solutions found or the tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b1ecfc8a2bf96046faa021457bf4438
https://doi.org/10.1007/3-540-32539-5_56
https://doi.org/10.1007/3-540-32539-5_56
