Results 31 to 40 of about 16,552 (267)
Domination analysis of combinatorial optimization problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutin, Gregory +2 more
openaire +1 more source
Bird Mating Optimizer for Combinatorial Optimization Problems
The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to solve continuous optimization problems with a very promising performance.
Anas Arram +3 more
doaj +1 more source
Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing
The metaheuristic algorithm is a very important area of research that continuously improves in solving optimization problems. Nature-inspired is one of the metaheuristic algorithm classifications that has grown in popularity among researchers over the ...
Aminu Aminu Muazu +2 more
doaj +1 more source
Hybrid Particle Swarm Optimization Algorithm for Process Planning
Process planning is a typical combinatorial optimization problem. When the scale of the problem increases, combinatorial explosion occurs, which makes it difficult for traditional precise algorithms to solve the problem.
Xu Zhang, Pan Guo, Hua Zhang, Jin Yao
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
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
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
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
Wasserstein robust combinatorial optimization problems
This paper discusses a class of combinatorial optimization problems with uncertain costs in the objective function. It is assumed that a sample of the cost realizations is available, which defines an empirical probability distribution for the random cost vector.
Jackiewicz, Marcel +2 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

