Results 31 to 40 of about 28,166 (165)
Fermionic quantum approximate optimization algorithm
Physical Review Research, 2023 Quantum computers are expected to accelerate solving combinatorial optimization problems, including algorithms such as Grover adaptive search and quantum approximate optimization algorithm (QAOA). However, many combinatorial optimization problems involve
Takuya Yoshioka +3 more
doaj +1 more source
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
Algorithms, 2021 Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which—under standard assumptions in complexity theory—cannot be solved in sub-exponential time
Tapani Toivonen, Markku Tukiainen
doaj +1 more source
Algorithm for Solving and Updating Combinatorial Skyline [PDF]
Jisuanji gongcheng, 2017 Existing algorithms for querying combinatorial Skyline have low pruning efficiency and unsatisfactory computing speed for low-dimensional data set.Aiming at these problems,this paper proposes a fast algorithm for solving and updating combinatorial ...
DONG Leigang,LIU Guohua
doaj +1 more source
Mathematical modeling of finite topologies
Karpatsʹkì Matematičnì Publìkacìï, 2020 Integer programming is a tool for solving some combinatorial optimization problems. In this paper, we deal with combinatorial optimization problems on finite topologies.
S.E. Monabbati, H. Torabi
doaj +1 more source
Discrete Mathematics, 1993 There are many interesting and sophisticated problems raised in the IMO, Putnam and other olympiads. Some of these problems have deep mathematical background, nice generalizations, and lead to new areas of research in combinatorics. In this paper several topics in this category (disjoint simplices, alternating simple path problems, balanced colorings, \
Akiyama, J., Hosono, K., Urabe, M.
openaire +2 more sources
Efficient Resource Allocation in RIS-Assisted UAVs-Enabled B5G/6G Networks Using Digital Twins
IEEE AccessRapid technological advancements have revolutionized how people live, work, and communicate. Given the rapidly growing need for data and bandwidth, replacing existing communication systems with agile and modern alternatives is crucial.
Aasma Shafi +2 more
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
Recursive Quantum Relaxation for Combinatorial Optimization Problems [PDF]
QuantumQuantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems.
Ruho Kondo +3 more
doaj +1 more source
Combinatorial Search Problems [PDF]
Proceedings. 1991 IEEE International Symposium on Information Theory, 1973 Publisher Summary This chapter discusses combinatorial search problems. There are many practical problems of this type. Wasserman-type blood test of a large population is such a problem. X is the set of some men. The test can be divided into two parts: (1) a sample of blood is drawn from every man and (2) the blood sample is subjected to a laboratory
openaire +2 more sources
An Ising Machine Approach to the Personalized Course Selection Problem
IEEE AccessA combinatorial optimization problem is a problem finding an optimal combination of variables that maximizes or minimizes an objective function while satisfying given constraints.
Takeru Ota +2 more
doaj +1 more source