Results 51 to 60 of about 28,166 (165)

A Combinatorial Problem in Geometry [PDF]

, 2009
Il s'agit d`une généralisation du problème suivant: Parmi 5 points dans un plan, dont il n'y en a pas 3 en ligne droite, on peut toujours en choisir 4 comme sommets d'un quadrilatère convexe. --- La généralisation proposée, scindée en deux questions, est la suivante: a) Peut-on déterminer un nombre \(N(n)\) de points dans le plan, suffisant pour que ...
Erdős, Pál, Szekeres, George
openaire   +2 more sources

Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent

Results in Physics
Combinatorial optimization has wide and high-value applications in many fields of science and industry, but solving general combinatorial optimization problems is non-deterministic polynomial time (NP) hard.
Xin Yi, Jia-Cheng Huo, Yong-Pan Gao, Ling Fan, Ru Zhang, Cong Cao   +5 more
doaj   +1 more source

Some Combinatorial Extremum Problems [PDF]

Proceedings of the American Mathematical Society, 1956
Motzkin, T. S., Straus, E. G.
openaire   +2 more sources

Ferroelectric compute-in-memory annealer for combinatorial optimization problems

Nature Communications
Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising machines, and quantum/photonic systems have been developed for solving COPs, but they still suffer from the ...
Xunzhao Yin, Yu Qian, Alptekin Vardar, Marcel Günther, Franz Müller, Nellie Laleni, Zijian Zhao, Zhouhang Jiang, Zhiguo Shi, Yiyu Shi, Xiao Gong, Cheng Zhuo, Thomas Kämpfe, Kai Ni   +13 more
doaj   +1 more source

Parallel genetic algorithms on combinatorial optimization problems

Revista Técnica de la Facultad de Ingeniería, 2011
In this work, we introduce several parallel approaches based on Genetic Algorithms to solve NP-complete problems. Each approach uses a different concept of the parallel computing.
Francisco Hidrobo, José Aguilar
doaj  

Approximate Solutions of Combinatorial Problems via Quantum Relaxations

IEEE Transactions on Quantum Engineering
Combinatorial problems are formulated to find optimal designs within a fixed set of constraints and are commonly found across diverse engineering and scientific domains.
Bryce Fuller, Charles Hadfield, Jennifer R. Glick, Takashi Imamichi, Toshinari Itoko, J. Richard Thompson, Yang Jiao, M. Marna Kagele, W. Blom-Schieber Adriana, Rudy Raymond, Antonio Mezzacapo   +10 more
doaj   +1 more source

A combinatorial problem.

Michigan Mathematical Journal, 1952
openaire   +2 more sources

A versatile large-scale coherent Ising machine from microwave to visible and telecom wavelength bands. [PDF]

Light Sci Appl
Zhang H, Li J, Zhu H.
europepmc   +1 more source

Combinatorial Problems [PDF]

, 2003
openaire   +1 more source

Simplicity and Complexity in Combinatorial Optimization. [PDF]

Entropy (Basel)
Dingle K, Hutter M.
europepmc   +1 more source