Results 41 to 50 of about 1,967,671 (302)
Direct Combinatorial Pathway Optimization [PDF]
ACS Synthetic Biology, 2016 Combinatorial engineering approaches are becoming increasingly popular, yet they are hindered by the lack of specialized techniques for both efficient introduction of sequence variability and assembly of numerous DNA parts, required for the construction of lengthy multigene pathways.
Pieter Coussement +3 more
openaire +4 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
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
Approximating incremental combinatorial optimization problems [PDF]
, 2018 We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps.
Unda, Francisco Tomas, Goemans, Michel X
core +1 more source
On the Landscape of Combinatorial Optimization Problems [PDF]
IEEE Transactions on Evolutionary Computation, 2014 This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment. We have focused on two types of properties, local average properties of the landscape, and properties of the local optima.
Tayarani Najaran, Mohammad +1 more
openaire +3 more sources
Approximating Incremental Combinatorial Optimization Problems [PDF]
, 2017 We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps.
Unda, Francisco, Goemans, Michel X.
core +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
Bulk-Robust combinatorial optimization [PDF]
Mathematical Programming, 2014 Mathematical Programming, 149 (1-2)
Adjiashvili, David +2 more
openaire +3 more sources
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
Combinatorial optimization and Green Logistics [PDF]
4OR, 2007 The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems. The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.
Abdelkader Sbihi, Richard W. Eglese
openaire +10 more sources