Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Boro Sofranac"'
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
Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer Programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stopping criteria are used to avoid problems with slow or infinite convergenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8264e5d17eb79d0645cf97461268bbc
Publikováno v:
Parallel Computing. 109:102874
Fast domain propagation of linear constraints has become a crucial component of today’s best algorithms and solvers for mixed integer programming and pseudo-boolean optimization to achieve peak solving performance. Irregularities in the form of dyn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49e3152f96c0f02e774febcb3ea04b78
https://doi.org/10.1016/j.parco.2021.102874
https://doi.org/10.1016/j.parco.2021.102874
Publikováno v:
IA3@SC
Fast domain propagation of linear constraints has become a crucial component of today's best algorithms and solvers for mixed integer programming and pseudo-boolean optimization to achieve peak solving performance. Irregularities in the form of dynam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39e5c7456598d516f715dd24aa560690
http://arxiv.org/abs/2009.07785
http://arxiv.org/abs/2009.07785