Results 281 to 290 of about 167,714 (331)

Optimization of robotic liquid handling as a capacitated vehicle routing problem.

Digit Discov
Wu G, Wang R, Coley CW.
europepmc   +1 more source

Combinatorial Problems in Compiler Optimization

, 2013
Mirza Omer Beg
openalex   +1 more source

Enhancing Beam Search with Machine Learning for Resource-Constrained Shortest Path Reformulation of Combinatorial Optimization Problems

Fulin Yan, François Clautiaux, Aurélien Froger, Boris Albar   +3 more
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Possibilistic Combinatorial Optimization Problems

2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence), 2008
This paper deals with a general combinatorial optimization problem with uncertain element weights modeled by fuzzy intervals. A fuzzy interval is regarded as a possibility distribution describing the set of more or less plausible values of an element weight.
Adam Kasperski, Pawel Zielinski 0001
openaire   +1 more source

The bandpass problem: combinatorial optimization and library of problems

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Djangir A. Babayev, George I. Bell, Urfat G. Nuriyev   +2 more
openaire   +4 more sources

On linear characterizations of combinatorial optimization problems

21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980
We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP = co-NP -- a very unlikely event. We also apply the ellipsoid method for linear programming to show that a combinatorial optimization problem is solvable in polynomial ...
Richard M. Karp, Christos H. Papadimitriou   +1 more
openaire   +1 more source

Combinatorial optimization problems in self-assembly

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02, 2002
Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing.
Leonard M. Adleman, Qi Cheng 0001, Ashish Goel, Ming-Deh A. Huang, David Kempe 0001, Pablo Moisset de Espanés, Paul W. K. Rothemund   +6 more
openaire   +1 more source

An Immunological Approach to Combinatorial Optimization Problems

2002
In this work we use a simplified model of the immune system to explore the problem solving feature. We consider only two immunological entities, antigens and antibodies, two parameters, and simple immune operators. The experimental results shows how a simple randomized search algorithm coupled with a mechanism for adaptive recognition of hardest ...
CUTELLO, Vincenzo, NICOSIA, GIUSEPPE
openaire   +2 more sources

Combinatorial Optimization Problems in Ultrametric Spaces

Theoretical and Mathematical Physics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Missarov M., Stepanov R.
openaire   +4 more sources