Results 21 to 30 of about 6,800,360 (294)
Combinatorial optimization problems with balanced regret
Discrete Applied Mathematics, 2023 For decision making under uncertainty, min-max regret has been established as a popular methodology to find robust solutions. In this approach, we compare the performance of our solution against the best possible performance had we known the true scenario in advance.
Marc Goerigk, Michael Hartisch
openaire +4 more sources
On Some Optimization Problems on Permutations
Кібернетика та комп'ютерні технології, 2022 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
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
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Multiobjective combinatorial optimization problems: social, keywords, and journal maps
, 2022 Multiobjective combinatorial optimization problems appear in a wide range of applications including operations research/management, engineering, biological sciences, and computer science.
Siamak Talatahari +7 more
core +1 more source
Minimum Entropy Combinatorial Optimization Problems [PDF]
Theory of Computing Systems, 2009 We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.
Cardinal, Jean +2 more
openaire +7 more sources
Optimization heuristics for the combinatorial auction problem [PDF]
The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004 This work presents and compares three heuristics for the combinatorial auction problem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulated annealing (SA), and a genetic algorithm (GA) approach are developed which use the combinatorial auction process to find an allocation with maximal revenue for the auctioneer.
Michael Schwind +2 more
openaire +3 more sources
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
An improved approach to resolve a combinatorial optimization problem based CoronaVirus Optimization Algorithm [PDF]
E3S Web of Conferences, 2022 Combinatorial optimization problems refer to intractable problems that can’t be performed using exact methods. The resolution of combinatorial problems geared towards the application of heuristics, metaheuristics also matheuristics, in order to provide ...
El Majdoubi Omayma +2 more
doaj +1 more source
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem [PDF]
Yugoslav Journal of Operations Research, 2011 Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets.
Pop Petrica, Pop-Sitar Corina
doaj +1 more source