Results 11 to 20 of about 28,946 (263)
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
Algorithm portfolio based scheme for dynamic optimization problems [PDF]
International Journal of Computational Intelligence Systems, 2015 Since their first appearance in 1997 in the prestigious journal Science, algorithm portfolios have become a popular approach to solve static problems. Nevertheless and despite that success, they have not received much attention in Dynamic Optimization ...
Jenny Fajardo Calderín +2 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
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
Central partition for a partition-distance and strong pattern graph
Revstat Statistical Journal, 2004 When several clustering algorithms are applied to a dataset E or the same algorithm with different parameters, we get several different partitions of the dataset.
Joaquim F. Pinto da Costa , P.R. Rao
doaj +1 more source
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
On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs
Mathematics, 2020 An equitable partition of a graph G is a partition of the vertex set of G such that the sizes of any two parts differ by at most one. The strong equitable vertexk-arboricity of G, denoted by vak≡(G), is the smallest integer t such that G can be equitably
Fangyun Tao, Ting Jin, Yiyou Tu
doaj +1 more source
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
Frontiers in Physics, 2022 Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems.
Tianyi Hao +5 more
doaj +1 more source
Combinatorial Problems in OpenAD [PDF]
, 2012 Computing derivatives using automatic differentiation methods entails a variety of combinatorial problems. The OpenAD tool implements automatic differentiation as source transformation of a program that represents a numerical model. We select three combinatorial problems and discuss the solutions implemented in OpenAD.
Utke, Jean, Naumann, Uwe
openaire +4 more sources
Dynamical System-Based Computational Models for Solving Combinatorial Optimization on Hypergraphs
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2023 The intrinsic energy minimization in dynamical systems offers a valuable tool for minimizing the objective functions of computationally challenging problems in combinatorial optimization. However, most prior works have focused on mapping such dynamics to
Mohammad Khairul Bashar +3 more
doaj +1 more source