Results 41 to 50 of about 167,714 (331)
An Ising Machine Approach to the Personalized Course Selection Problem
A 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
On Some Optimization Problems on Permutations
Numerous studies consider combinatorial optimization problems and their solution methods, since a large number of practical problems are described by means of combinatorial optimization models.
Georgy Donets, Vasyl Biletskyi
doaj +1 more source
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
AS Tanenbaum +19 more
core +2 more sources
Assembly sequence planning (ASP) of remote handling maintenance in radioactive environment is a combinatorial optimization problem. This study proposes an improved shuffled frog leaping algorithm (SFLA) for the combinatorial optimization problem of ASP ...
Jianwen Guo +6 more
doaj +1 more source
The backtracking survey propagation algorithm for solving random K-SAT problems [PDF]
Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.
Marino, Raffaele +2 more
core +2 more sources
Preference Optimization for Combinatorial Optimization Problems
This paper has been accepted by ICML ...
Mingjun Pan +6 more
openaire +2 more sources
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm mechanisms provides diverse approaches to handle combinatorial optimization challenges.
Anniza Hamdan +4 more
doaj
Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
Combinatorial 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
State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems
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
Similarity-based parameter transferability in the quantum approximate optimization algorithm
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

