Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Shinano, Yuji"'
Autor:
Bolusani, Suresh, Besançon, Mathieu, Bestuzheva, Ksenia, Chmiela, Antonia, Dionísio, João, Donkiewicz, Tim, van Doornmalen, Jasper, Eifler, Leon, Ghannam, Mohammed, Gleixner, Ambros, Graczyk, Christoph, Halbig, Katrin, Hedtke, Ivo, Hoen, Alexander, Hojny, Christopher, van der Hulst, Rolf, Kamp, Dominik, Koch, Thorsten, Kofler, Kevin, Lentz, Jurgen, Manns, Julian, Mexi, Gioni, Mühmer, Erik, Pfetsch, Marc E., Schlösser, Franziska, Serrano, Felipe, Shinano, Yuji, Turner, Mark, Vigerske, Stefan, Weninger, Dieter, Xu, Lixing
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in the SCIP
Externí odkaz:
http://arxiv.org/abs/2402.17702
Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB. It is known that QAP tai256c can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint which requir
Externí odkaz:
http://arxiv.org/abs/2401.09439
Autor:
Bestuzheva, Ksenia, Besançon, Mathieu, Chen, Wei-Kun, Chmiela, Antonia, Donkiewicz, Tim, van Doornmalen, Jasper, Eifler, Leon, Gaul, Oliver, Gamrath, Gerald, Gleixner, Ambros, Gottwald, Leona, Graczyk, Christoph, Halbig, Katrin, Hoen, Alexander, Hojny, Christopher, van der Hulst, Rolf, Koch, Thorsten, Lübbecke, Marco, Maher, Stephen J., Matter, Frederic, Mühmer, Erik, Müller, Benjamin, Pfetsch, Marc E., Rehfeldt, Daniel, Schlein, Steffan, Schlösser, Franziska, Serrano, Felipe, Shinano, Yuji, Sofranac, Boro, Turner, Mark, Vigerske, Stefan, Wegscheider, Fabian, Wellner, Philipp, Weninger, Dieter, Witzig, Jakob
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 supportin
Externí odkaz:
http://arxiv.org/abs/2303.07101
Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB; a 1.48\% gap remains between the best known feasible objective value and lower bound of the unknown optimal value. This paper shows that the instance can be conver
Externí odkaz:
http://arxiv.org/abs/2210.15963
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic unconstrained binary optimization problem have experienced much interest
Externí odkaz:
http://arxiv.org/abs/2202.02305
Autor:
Bestuzheva, Ksenia, Besançon, Mathieu, Chen, Wei-Kun, Chmiela, Antonia, Donkiewicz, Tim, van Doornmalen, Jasper, Eifler, Leon, Gaul, Oliver, Gamrath, Gerald, Gleixner, Ambros, Gottwald, Leona, Graczyk, Christoph, Halbig, Katrin, Hoen, Alexander, Hojny, Christopher, van der Hulst, Rolf, Koch, Thorsten, Lübbecke, Marco, Maher, Stephen J., Matter, Frederic, Mühmer, Erik, Müller, Benjamin, Pfetsch, Marc E., Rehfeldt, Daniel, Schlein, Steffan, Schlösser, Franziska, Serrano, Felipe, Shinano, Yuji, Sofranac, Boro, Turner, Mark, Vigerske, Stefan, Wegscheider, Fabian, Wellner, Philipp, Weninger, Dieter, Witzig, Jakob
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 8.0 of the S
Externí odkaz:
http://arxiv.org/abs/2112.08872
Publikováno v:
In Computers and Operations Research May 2024 165
Empirical studies are fundamental in assessing the effectiveness of implementations of branch-and-bound algorithms. The complexity of such implementations makes empirical study difficult for a wide variety of reasons. Various attempts have been made
Externí odkaz:
http://arxiv.org/abs/2104.10025
We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization problems such as QAPs is a parallel branch-and-bound method efficiently imp
Externí odkaz:
http://arxiv.org/abs/2101.09629
Publikováno v:
In EURO Journal on Transportation and Logistics 2022 11