Advances in Graph Neural Networks for Combinatorial Optimization Problems [PDF]
Jisuanji kexue yu tansuoCombinatorial optimization, as an important branch of mathematical optimization, focuses on finding optimal solution within a finite discrete solution space.
ZHU Ye, DING Cangfeng, CAO Bohao, CHEN Kexin
doaj +1 more source
Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
IEEE AccessCombinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem size.
Naoya Onizawa +4 more
doaj +1 more source
International Journal of Advanced Robotic Systems, 2017 This article presents a critical evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Since, unarguably, the traveling salesman’s problem is the most developed, studied, and popular combinatorial problem, this ...
Julius Odili +3 more
doaj +1 more source
A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj
State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems
IEEE Access, 2019 A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han +3 more
doaj +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Similarity-based parameter transferability in the quantum approximate optimization algorithm
Frontiers in Quantum Science and Technology, 2023 The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda +10 more
doaj +1 more source
Going viral − Virus‐targeting nanobodies for research, diagnostics and therapy
FEBS Letters, EarlyView.The increasing prevalence of viral diseases represents a major threat for global human health. Nanobodies, small binding fragments derived from camelid heavy‐chain antibodies, offer versatile tools for viral research, diagnostics, and antiviral therapy.
Domenic Ebert, Ulrich Rothbauer
wiley +1 more source
Combinatorial optimization of permutation-based quadratic assignment problem using optics inspired optimization [PDF]
Journal of Applied Research on Industrial Engineering, 2019 A lot of real-world problems such as the assignment of special rooms in hospitals, operating room layout, image processing, etc., could be formulated in terms of Quadratic assignment problem. Different exact methods are suggested to solve these problems,
Soheila Badrloo, Ali Husseinzadeh Kashan
doaj +1 more source
Trip Planning Based on subQUBO Annealing
IEEE Access, 2023 The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels.
Tatsuya Noguchi +3 more
doaj +1 more source