Results 51 to 60 of about 8,140,957 (328)
Nuevas técnicas de particionamiento en clasificación automática
In this article there are exposed some new thechniques for hte search of global optima inthe partitioning problem in Cluster Analysis. With these thechniques the results are sensibly improved with respect to the traditional methods. The methods developed
Eduardo Piza Volio +2 more
doaj +1 more source
Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty
In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items.
Yaman, Hande
doaj +1 more source
A decade of combinatorial optimization [PDF]
This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial-time algorithms for problems on graphs and networks, and review the methodological and computational ...
Aardal, K. +8 more
core +3 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
Preference Optimization for Combinatorial Optimization Problems
This paper has been accepted by ICML ...
Mingjun Pan +6 more
openaire +4 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
Advances in Graph Neural Networks for Combinatorial Optimization Problems [PDF]
Combinatorial 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
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
Formulations and Metaheuristics for combinatorial optimization problems [PDF]
Combinatorial optimization problems have been strongly addressed throughout history. Their study involves highly applied problems that must be solved in reasonable times. This doctoral Thesis addresses three Operations Research problems: the first deals with the Traveling Salesman Problem with Pickups and Delivery with Handling cost, which was ...
openaire +2 more sources
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

