Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Gerald Gamrath"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 8, Iss 3, Pp 241-261 (2020)
Dual degeneracy, i.e., the presence of multiple optimal bases to a linear programming (LP) problem, heavily affects the solution process of mixed integer programming (MIP) solvers. Different optimal bases lead to different cuts being generated, diffe
Externí odkaz:
https://doaj.org/article/02acf5f02ecf4593a8b6c0599764c3ca
Autor:
Gerald Gamrath
Publikováno v:
EURO Journal on Computational Optimization, Vol 2, Iss 3, Pp 99-122 (2014)
One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on. It precom
Externí odkaz:
https://doaj.org/article/041acfb2425f40c2b14433b148b10f1a
Autor:
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska SchlÃŰsser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig
Publikováno v:
ACM Transactions on Mathematical Software.
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP . The focus of this paper is on the role of the SCIP Optimization Suite in supporti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::578d0e2e73fb9ca5703e6f8eacf8b413
https://doi.org/10.1145/3585516
https://doi.org/10.1145/3585516
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
Autor:
Gerald Gamrath, Ambros M. Gleixner, Matthias Miltenberger, Dominik Schlögel, Dieter Weninger, Dimitri Kniasew, Alex Martin, Thorsten Koch
Publikováno v:
Journal of Computational Mathematics. 37:866-888
SAP's decision support systems for optimized supply network planning rely on mixed-integer programming as the core engine to compute optimal or near-optimal solutions. The modeling flexibility and the optimality guarantees provided by mixed-integer p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5374ad0bbd5fb99c87c0d608df4fd83d
https://doi.org/10.4208/jcm.1905-m2019-0055
https://doi.org/10.4208/jcm.1905-m2019-0055
Publikováno v:
Mathematical Programming Computation. 11:675-702
Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They often provide good feasible solutions early and help to reduce the time needed to prove optimality. In this paper, we present a scheme for start heuristics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9822e18140a2dee95e9fe05d84cfcb0f
https://doi.org/10.1007/s12532-019-00159-1
https://doi.org/10.1007/s12532-019-00159-1
Publikováno v:
Mathematical Programming Computation. 9:231-296
The Steiner tree problem in graphs is a classical problem that commonly arises in practical applications as one of many variants. While often a strong relationship between different Steiner tree problem variants can be observed, solution approaches e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ad7e820ebb75a3ae1fabe24935ce762
https://doi.org/10.1007/s12532-016-0114-x
https://doi.org/10.1007/s12532-016-0114-x
Autor:
Gerald Gamrath, Christoph Schubert
Publikováno v:
Operations Research Proceedings ISBN: 9783319899190
Branching rules are an integral component of the branch-and-bound algorithm typically used to solve mixed-integer programs and subject to intense research. Different approaches for branching are typically compared based on the solving time as well as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cdf2e134c150bffb4d1253d67c0631f
https://doi.org/10.1007/978-3-319-89920-6_23
https://doi.org/10.1007/978-3-319-89920-6_23
Publikováno v:
Mathematical Programming Computation. 7:367-398
This paper describes three presolving techniques for solving mixed integer programming problems (MIPs) that were implemented in the academic MIP solver SCIP. The task of presolving is to reduce the problem size and strengthen the formulation, mainly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d344623ad9ca14d7c178170e7591c779
https://doi.org/10.1007/s12532-015-0083-5
https://doi.org/10.1007/s12532-015-0083-5
Publikováno v:
Optimization in the Real World ISBN: 9784431554196
Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They help to reach optimality faster and provide good feasible solutions early in the solving process. In this paper, we present two new primal heuristics which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76d429f2233f688ad7471773e423d9e0
https://doi.org/10.1007/978-4-431-55420-2_3
https://doi.org/10.1007/978-4-431-55420-2_3