Results 1 to 10 of about 4,919,639 (299)
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm [PDF]
BiomimeticsThe 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 +4 more sources
Binary Pufferfish Optimization Algorithm for Combinatorial Problems [PDF]
BiomimeticsMetaheuristics 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
Mathematics, 2021 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
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
Applied Sciences, 2021 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
Hysteresis in Combinatorial Optimization Problems
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 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
Mathematics, 2022 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
Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review
Mathematics, 2022 For years, extensive research has been in the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. This paper is a continuation of a previous review and seeks to draw a comprehensive picture of the various ways to ...
Marcelo Becerra-Rozas +7 more
doaj +1 more source
Mathematics, 2021 Currently, industry is undergoing an exponential increase in binary-based combinatorial problems. In this regard, metaheuristics have been a common trend in the field in order to design approaches to successfully solve them.
José Lemus-Romani +11 more
doaj +1 more source
On a Combinatorial Generation Problem of Knuth [PDF]
SIAM Journal on Computing, 2021 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 +5 more sources
Reducing off-line to on-line: An example and its applications [PDF]
Yugoslav Journal of Operations Research, 2003 We study on-line versions of maximum weighted hereditary subgraph problems for which the instance is revealed in two clusters. We focus on the comparison of these on-line problems with their respective off-line versions.
Demange Marc
doaj +1 more source