Rule-Based Classification Based on Ant Colony Optimization: A Comprehensive Review by Sayed Kaes Maruf Hossain, Sajia Afrin Ema, Hansuk Sohn

“…The Ant Colony Optimization (ACO) algorithms have been well-studied by the Operations Research community for solving combinatorial optimization problems. A handful of researchers in the Data Science community have successfully implemented various ACO methodologies for rule-based classification. …”
Get full text

Ranking of Search Requests in the Digital Information Retrieval System Based on Dynamic Neural Networks by Viera Bartosova, Svetlana Drobyazko, Sergii Bogachov, Olga Afanasieva, Maria Mikhailova

“…The architecture of the neural network model based on the dynamic Hopfield neural network with binary output function designed for combinatorial optimization of the final list of documents found in the digital information retrieval system was synthesized. …”
Get full text

Solution Algorithms for the Capacitated Location Tree Problem with Interconnections by Nidia Mendoza-Andrade, Efrain Ruiz-y-Ruiz, Suemi Rodriguez-Romo

“…This paper addresses the Capacitated Location Tree Problem with Interconnections, a new combinatorial optimization problem with applications in network design. …”
Get full text

Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies With Higher Order Formulations by Yuki Sano, Kosuke Mitarai, Naoki Yamamoto, Naoki Ishikawa

“…Our strategies are also beneficial for general combinatorial optimization problems using one-hot encoding.…”
Get full text

Classical and quantum algorithms for many-body problems by Ayral, Thomas

“…The many-body problem is central to many fields, such as condensed-matter physics and chemistry, but also to combinatorial optimization, which is nothing but a classical many-body problem. …”
Get full text

Smart Grid Dispatching Optimization for System Resilience Improvement by Li Liao, Chengjun Ji

“…The solution method of combinatorial optimization is analyzed, and the genetic optimization algorithm adopted in this paper is selected and discussed. …”
Get full text

A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics by Hao Chen, Baorong Zhai, Jiangjiang Wu, Chun Du, Jun Li

“…The scheduling of Earth Observation Satellite (EOS) data transmission is a complex combinatorial optimization problem. With the development of remote sensing applications, a new special requirement named data transmission oriented to topics has appeared. …”
Get full text

Suppressing the Endogenous Negative Influence Through Node Intervention in Social Networks by Satoshi Furutani, Tatsuhiro Aoshima, Toshiki Shibahara, Mitsuaki Akiyama, Masaki Aida

“…We formulate this problem as a combinatorial optimization problem on graphs. We prove that this problem is NP-hard and propose approximation algorithms to identify optimal intervention nodes that minimize the negative influence. …”
Get full text

Enhancing computational accuracy with parallel parameter optimization in variational quantum eigensolver by Daisuke Tsukayama, Jun-ichi Shirakashi, Tetsuo Shibuya, Hiroshi Imai

“…This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.…”
Get full text

Hybrid subQUBO Annealing With a Correction Process for Multi-Day Intermodal Trip Planning by Tatsuya Noguchi, Keisuke Fukada, Siya Bao, Nozomu Togawa

“…Quantum annealers have recently been explored as a powerful tool for solving combinatorial optimization problems by converting the problems into Quadratic Unconstrained Binary Optimization (QUBO). …”
Get full text

Efficient digital quadratic unconstrained binary optimization solvers for SAT problems by Robert Simon Fong, Yanming Song, Alexander Yosifov

“…Boolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision problems or Max k -SAT optimization problems, with conflict-driven clause learning (CDCL) solvers being the most prominent. …”
Get full text

Quantum Speedup of the Dispersion and Codebook Design Problems by Kein Yukiyoshi, Taku Mikuriya, Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, Naoki Ishikawa

“…Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in coding theory and wireless communications applications involving optimal codebook design. …”
Get full text

Multiobjective Optimization and Network Routing With Near-Term Quantum Computers by Shao-Hen Chiew, Kilian Poirier, Rajesh Mishra, Ulrike Bornheimer, Ewan Munro, Si Han Foon, Christopher Wanru Chen, Wei Sheng Lim, Chee Wei Nga

“…In this work, we develop a scheme with which near-term quantum computers can be applied to solve multiobjective combinatorial optimization problems. We study the application of this scheme to the network routing problem in detail, by first mapping it to the multiobjective shortest-path problem. …”
Get full text

Incentivizing Demand-Side Response Through Discount Scheduling Using Hybrid Quantum Optimization by David Bucher, Jonas Nuslein, Corey O'Meara, Ivan Angelov, Benedikt Wimmer, Kumar Ghosh, Giorgio Cortiana, Claudia Linnhoff-Popien

“…Since we tailor the discounts to individual customers' consumption, the discount scheduling problem (DSP) becomes a large combinatorial optimization task. Consequently, we adopt a hybrid quantum computing approach, using D-Wave's Leap Hybrid Cloud. …”
Get full text