Results 31 to 40 of about 211,682 (273)
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
Adiabatic evolution on a spatial-photonic Ising machine [PDF]
, 2020 Combinatorial optimization problems are crucial for widespread applications but remain difficult to solve on a large scale with conventional hardware.
Conti, C., Marcucci, G., Pierangeli, D.
core +2 more sources
Química Nova, 2001 Combinatorial Chemistry has become a very efficient methodology in drug research. Recent progress in combinatorial synthesis performed both in solid and solution phase have led to a change in the paradigm for the identification and optimization of lead ...
Ricardo L. Araújo Dias +1 more
doaj +1 more source
Discrete Applied Mathematics, 2005 This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed ...
openaire +2 more sources
Natural evolution strategies and variational Monte Carlo
, 2020 A notion of quantum natural evolution strategies is introduced, which provides a geometric synthesis of a number of known quantum/classical algorithms for performing classical black-box optimization. Recent work of Gomes et al.
Carleo, Giuseppe +3 more
core +1 more source
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
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
Highly connected orientations from edge-disjoint rigid subgraphs
Forum of Mathematics, PiWe give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a k-vertex-connected orientation. We prove that a connectivity of order $O(k^2)$ suffices.
Dániel Garamvölgyi +3 more
doaj +1 more source
Combinatorial Assortment Optimization
, 2017 Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience store. The price of each product is fixed in advance, and a probabilistic choice function describes
A Alptekinolu +9 more
core +1 more source
Bird Mating Optimizer for Combinatorial Optimization Problems
IEEE Access, 2020 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