Results 211 to 220 of about 17,512 (264)

Free quantum computing. [PDF]

Proc Natl Acad Sci U S A
Carette J, Heunen C, Kaarsgaard R, Ross NJ, Sabry A.   +4 more
europepmc   +1 more source

Mapping the intellectual structure of the refrigerated vehicle routing problem: research perspectives and structural knowledge gaps. [PDF]

Front Res Metr Anal
Aristizábal Torres D, Peñuela Meneses CA, Santa Chávez JJ, Escobar Falcón LM.   +3 more
europepmc   +1 more source

Local equations describe unreasonably efficient stochastic algorithms in random K-SAT. [PDF]

Proc Natl Acad Sci U S A
Machado D, González-García J, Mulet R.
europepmc   +1 more source

Quantum Computing for Transport Network Optimization. [PDF]

Entropy (Basel)
Ju J, Liu Z, Bai Y, Wang Y, Gao Q, Ma Y, Zheng C, Wen K.   +7 more
europepmc   +1 more source

Optimal Diagnosis Strategy via Functional Extremum Transformation and Fault Elimination Neural Network: A Minimum Diagnosis-Cost Approach for Complex Systems. [PDF]

Sensors (Basel)
Su Y, Liu Z, Li X, Tang X, Wang M, Wang J.   +5 more
europepmc   +1 more source

Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem. [PDF]

Nat Commun
Zhang R, Li X, Wan C, Hoffmann R, Hindenberg M, Xu Y, Liu S, Kong D, Xiong S, He S, Vardar A, Dai Q, Gong J, Sun Y, Zheng Z, Kämpfe T, Yu G, Han X.   +17 more
europepmc   +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 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