Results 41 to 50 of about 6,800,360 (294)
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
Preference Optimization for Combinatorial Optimization Problems
CoRRThis paper has been accepted by ICML ...
Mingjun Pan +6 more
openaire +4 more sources
Conflict Resolution as a Combinatorial Optimization Problem
Information, 2023 Within the framework of the mathematical theory of conflicts, we consider a multi-criterial conflict situation using the example of a child–parent conflict. A general method for constructing a conflict diagram is described and possible ways of the conflicting parties influencing each other in this conflict situation are discussed. We introduce criteria
Ekaterina Antipova, Sergey Rashkovskiy
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
Tạp chí Khoa học Đại học Đà Lạt, 2017 The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj +1 more source
On simple combinatorial optimization problems
Discrete Mathematics, 1992 AbstractWe characterize (0,1) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.
openaire +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
MATHEMATICAL MODEL FOR OPTIMIZATION PROBLEM OF ONE MULTIPROCESSING COMPUTER SYSTEM AND ITS SOLUTION
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2011 The mathematical model of task of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on vertex-located set is formed.
O.A. Yemets +2 more
doaj +1 more source
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
IEEE Access, 2020 Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances.
Natalia Vesselinova +3 more
doaj +1 more source
On the depth of combinatorial optimization problems
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources