Results 1 to 10 of about 28,946 (263)
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm [PDF]
The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for
Dante Leiva +4 more
doaj +2 more sources
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been ...
Md Ashikur Rahman +5 more
doaj +3 more sources
Binary Pufferfish Optimization Algorithm for Combinatorial Problems [PDF]
Metaheuristics are a fundament pillar of Industry 4.0, as they allow for complex optimization problems to be solved by finding good solutions in a reasonable amount of computational time.
Broderick Crawford +9 more
doaj +2 more sources
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in ...
Fernando Peres, Mauro Castelli
doaj +3 more sources
Many combinatorial optimization problems (COPs) encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized
Angel A. Juan +4 more
doaj +3 more sources
Hysteresis in Combinatorial Optimization Problems
Hysteresis is a physical phenomenon reflected in macroscopic observables of materials that are subjected to external perturbations. For example, magnetic hysteresis is observed in ferromagnetic metals such as iron, nickel and cobalt in the presence of a ...
Yuling Guan +4 more
doaj +1 more source
This paper presents a new procedure for computing the set of supported non-dominated solutions of bi-criteria minimum spanning tree problems in ordered manner.
Carlos Gomes da Silva +1 more
doaj +1 more source
On a Combinatorial Generation Problem of Knuth [PDF]
The well-known middle levels conjecture asserts that for every integer $n\geq 1$, all binary strings of length $2(n+1)$ with exactly $n+1$ many 0s and 1s can be ordered cyclically so that any two consecutive strings differ in swapping the first bit with a complementary bit at some later position. In his book `The Art of Computer Programming Vol.
Arturo Merino +2 more
openaire +4 more sources
On analytic problems of combinatorial structures
There is not abstract.
Eugenijus Manstavičius
doaj +3 more sources
In recent years, continuous metaheuristics have been a trend in solving binary-based combinatorial problems due to their good results. However, to use this type of metaheuristics, it is necessary to adapt them to work in binary environments, and in ...
Marcelo Becerra-Rozas +5 more
doaj +1 more source

