Results 31 to 40 of about 6,800,360 (294)
Editorial for the Special Issue on Combinatorial Optimization Problems [PDF]
, 2016 First paragraph: In combinatorial optimization, the goal is to find an optimal solution, according to some objective function, from a discrete search space. These problems arise widely in industry and academia and, unfortunately, many of them are NP-hard
Chicano, Francisco +2 more
core +1 more source
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
Applications of Modelling and Simulation, 2023 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
The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems
Revista de Matemática: Teoría y Aplicaciones, 2012 En este articulo es presentado un algoritmo distribuido basado en conceptos de los Sistemas de Hormiga, llamado Sistema Combinatorio de Hormigas, para resolver problemas de optimización combinatoria dinámicos.
Jose Aguilar
doaj +1 more source
Mathematical modeling of finite topologies
Karpatsʹkì Matematičnì Publìkacìï, 2020 Integer programming is a tool for solving some combinatorial optimization problems. In this paper, we deal with combinatorial optimization problems on finite topologies.
S.E. Monabbati, H. Torabi
doaj +1 more source
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Research, 2020 Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +1 more source
Solving Combinatorial Optimization Problems on Quantum Computers
Кібернетика та комп'ютерні технології, 2020 Introduction. Quantum computers provide several times faster solutions to several NP-hard combinatorial optimization problems in comparison with computing clusters.
Vyacheslav Korolyov +1 more
doaj +1 more source
Approximating incremental combinatorial optimization problems [PDF]
, 2018 We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps.
Unda, Francisco Tomas, Goemans, Michel X
core +1 more source
Orthogonal methods based ant colony search for solving continuous optimization problems [PDF]
, 2008 Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation.
Jun Zhang +5 more
core +1 more source
Ant colony optimisation and local search for bin-packing and cutting stock problems [PDF]
, 2004 The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic ...
Levine, J, Ducatelle, F
core +4 more sources
Bee Colony Optimization - part II: The application survey [PDF]
Yugoslav Journal of Operations Research, 2015 Bee Colony Optimization (BCO) is a meta-heuristic method based on foraging habits of honeybees. This technique was motivated by the analogy found between the natural behavior of bees searching for food and the behavior of optimization algorithms
Teodorović Dušan +2 more
doaj +1 more source