Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Gary A. Kochenberger"'
Autor:
Haibo Wang, Gary A. Kochenberger, Yu Du, Mark W. Lewis, Takeshi Tsuyuguchi, Weihong Xie, Fred Glover
Publikováno v:
International Journal of Information Technology & Decision Making. 21:59-81
Finding good solutions to clique partitioning problems remains a computational challenge. With rare exceptions, finding optimal solutions for all but small instances is not practically possible. However, choosing the most appropriate modeling structu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2444f050738798bd79ca93551d81d7e
https://doi.org/10.1142/s0219622021500504
https://doi.org/10.1142/s0219622021500504
Publikováno v:
Networks. 77:322-340
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e564df04fdf2a6b81e5fc01c5e52fa7
https://doi.org/10.1002/net.22020
https://doi.org/10.1002/net.22020
Publikováno v:
Annals of operations research. 314(1)
Quantum Bridge Analytics relates to methods and systems for hybrid classical-quantum computing, and is devoted to developing tools for bridging classical and quantum computing to gain the benefits of their alliance in the present and enable enhanced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9bea0f9ba40e7c4aabdc554c43a8dc0
https://pubmed.ncbi.nlm.nih.gov/35531564
https://pubmed.ncbi.nlm.nih.gov/35531564
Publikováno v:
4OR. 17:335-371
Quantum Bridge Analytics relates generally to methods and systems for hybrid classical-quantum computing, and more particularly is devoted to developing tools for bridging classical and quantum computing to gain the benefits of their alliance in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db414ccbe90ef2639fcd626773463de8
https://doi.org/10.1007/s10288-019-00424-y
https://doi.org/10.1007/s10288-019-00424-y
Publikováno v:
Mathematical Programming with Data Perturbations II
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7a0dac00be3082bf09cf485a48c2c99
https://doi.org/10.1201/9781003071884-7
https://doi.org/10.1201/9781003071884-7
Publikováno v:
Journal of Heuristics. 25:643-671
We introduce new diversification methods for zero-one optimization that significantly extend strategies previously introduced in the setting of metaheuristic search. Our methods incorporate easily implemented strategies for partitioning assignments o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37bed4b64408d5bea2838d984091711b
https://doi.org/10.1007/s10732-018-9399-4
https://doi.org/10.1007/s10732-018-9399-4
Publikováno v:
European Journal of Operational Research. 265:829-842
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to transform
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e14110556253b86c0d67a9db262dfb2d
https://doi.org/10.1016/j.ejor.2017.08.025
https://doi.org/10.1016/j.ejor.2017.08.025
Publikováno v:
Management Decision. 55:786-807
Purpose The authors develop a framework to build an early warning mechanism in detecting financial deterioration of Chinese companies. Many studies in the financial distress and bankruptcy prediction literature rarely do they examine the impact of pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::271c4f5d621826e6b680c761f5a65004
https://doi.org/10.1108/md-08-2016-0546
https://doi.org/10.1108/md-08-2016-0546
Publikováno v:
Optimization Letters. 9:1331-1339
The generalized vertex cover problem (GVCP) was recently introduced in the literature and modeled as a binary linear program. GVCP extends classic vertex cover problems to include both node and edge weights in the objective function. Due to reported
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62ab515bbd94f17fe08b0c4a83a6f003
https://doi.org/10.1007/s11590-015-0851-1
https://doi.org/10.1007/s11590-015-0851-1
Publikováno v:
Annals of Data Science. 1:15-23
In this paper, we investigate a natural nonlinear alternative to a standard linear model for CCP and compare the two models on a set of test problems. Our results show that moderate sized instances of CCP can in fact be solved optimally with modern e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::daf71b47d292729674c63ea28667be00
https://doi.org/10.1007/s40745-014-0003-y
https://doi.org/10.1007/s40745-014-0003-y