Gaussian Mean Fields Lattice Gas
We study rigorously a lattice gas version of the Sherrington-Kirckpatrick spin glass model. In discrete optimization literature this problem is known as Unconstrained Binary Quadratic Programming (UBQP) and it belongs to the class NP-hard.
Scoppola, Benedetto, Troiani, Alessio
core +1 more source
An interior point algorithm for minimum sum-of-squares clustering [PDF]
Copyright @ 2000 SIAM PublicationsAn exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of ...
Du Merle, O +3 more
core +2 more sources
Ortalama-varyans portföy optimizasyonunda genetik algoritma uygulamaları üzerine bir literatür araştırması [PDF]
Mean-variance portfolio optimization model, introduced by Markowitz, provides a fundamental answer to the problem of portfolio management. This model seeks an efficient frontier with the best trade-offs between two conflicting objectives of maximizing ...
Akyer, Hasan +3 more
core +2 more sources
Eine Heuristik für quadratische 0-1-Probleme [PDF]
Eine neue Modellformulierung für kombinatorische Optimierungsprobleme wird vorgestellt. Auf der Grundlage des quadratischen 0-1-Problems ohne Nebenbedingungen wird ein vorteilhafter Typ kombinatorischer Optimierungsprobleme eingeführt.
Forster, Matthias
core +1 more source
Quadratic unconstrained binary optimization formulation for rectified-linear-unit-type functions [PDF]
5 pages, 2 ...
Sato, Go +4 more
openaire +3 more sources
Particle algorithms for optimization on binary spaces
We discuss a unified approach to stochastic optimization of pseudo-Boolean objective functions based on particle methods, including the cross-entropy method and simulated annealing as special cases.
Schäfer, Christian
core +2 more sources
Total positivity in exponential families with application to binary variables
We study exponential families of distributions that are multivariate totally positive of order 2 (MTP2), show that these are convex exponential families, and derive conditions for existence of the MLE.
Lauritzen, Steffen +2 more
core +1 more source
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem [PDF]
We show that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph $G$ can be solved using an adiabatic quantum computer that implements an Ising spin-1/2 Hamiltonian, by reduction through minor-embedding of $G$ in the quantum
Choi, Vicky
core +2 more sources
Multi-Objective Optimization Technique Based on QUBO and an Ising Machine
With an increase in the complexity of society, solving multi-objective optimization problems (MOPs) has become crucial. In this study, we introduced a novel method called “quadratic unconstrained binary optimization based on the weighted normal ...
Hiroshi Ikeda, Takashi Yamazaki
doaj +1 more source
Prime factorization using quantum annealing and computational algebraic geometry
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr\"obner bases. We present a novel scalable algorithm which combines the two approaches and leads to the factorization of all ...
Alghassi, Hedayat, Dridi, Raouf
core +1 more source

