Results 1 to 10 of about 36,738 (263)

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, David Bauwens, Jo Maertens, Marjan De Mey   +3 more
openaire   +4 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

Highly connected orientations from edge-disjoint rigid subgraphs

Forum of Mathematics, Pi
We 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, Tibor Jordán, Csaba Király, Soma Villányi   +3 more
doaj   +1 more source

Universally Balanced Combinatorial Optimization Games

Games, 2010
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization ...
Xiaotie Deng, Gabrielle Demange
doaj   +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, Masri Ayob, Graham Kendall, Alaa Sulaiman   +3 more
doaj   +1 more source

An Ising Machine Approach to the Personalized Course Selection Problem

IEEE Access
A combinatorial optimization problem is a problem finding an optimal combination of variables that maximizes or minimizes an objective function while satisfying given constraints.
Takeru Ota, Keisuke Fukada, Nozomu Togawa   +2 more
doaj   +1 more source

APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP

Tạp chí Khoa học Đại học Đà Lạt, 2017
The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj   +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, Prugel-Bennett, Adam   +1 more
openaire   +3 more sources

Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems

IEEE Access
Combinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem size.
Naoya Onizawa, Ryoma Sasaki, Duckgyu Shin, Warren J. Gross, Takahiro Hanyu   +4 more
doaj   +1 more source

MATHEMATICAL MODEL FOR OPTIMIZATION PROBLEM OF ONE MULTIPROCESSING COMPUTER SYSTEM AND ITS SOLUTION

Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2011
The mathematical model of task of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on vertex-located set is formed.
O.A. Yemets, Ye.M. Yemets, T.V. Chilikina   +2 more
doaj   +1 more source