Results 61 to 70 of about 8,140,957 (328)

A comparative evaluation of swarm intelligence techniques for solving combinatorial optimization problems

open access: yesInternational Journal of Advanced Robotic Systems, 2017
This article presents a critical evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Since, unarguably, the traveling salesman’s problem is the most developed, studied, and popular combinatorial problem, this ...
Julius Odili   +3 more
doaj   +1 more source

Domination analysis of combinatorial optimization problems

open access: yesDiscrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gregory Z. Gutin   +2 more
openaire   +2 more sources

A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]

open access: yesJournal of Systemics, Cybernetics and Informatics, 2007
In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj  

State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems

open access: yesIEEE Access, 2019
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han   +3 more
doaj   +1 more source

Similarity-based parameter transferability in the quantum approximate optimization algorithm

open access: yesFrontiers in Quantum Science and Technology, 2023
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda   +10 more
doaj   +1 more source

On the depth of combinatorial optimization problems

open access: yesDiscrete Applied Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Organoids in pediatric cancer research

open access: yesFEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

On simple combinatorial optimization problems

open access: yesDiscrete Mathematics, 1992
AbstractWe characterize (0,1) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.
openaire   +1 more source

Dominance rules in combinatorial optimization problems [PDF]

open access: yesEuropean Journal of Operational Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoine Jouglet, Jacques Carlier
openaire   +3 more sources

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy