Results 31 to 40 of about 18,556 (186)
Petri Net Modeling for Ising Model Formulation in Quantum Annealing
Applied Sciences, 2021 Quantum annealing is an emerging new platform for combinatorial optimization, requiring an Ising model formulation for optimization problems. The formulation can be an essential obstacle to the permeation of this innovation into broad areas of everyday ...
Morikazu Nakamura +2 more
doaj +1 more source
Fast Image Recovery Using Variable Splitting and Constrained Optimization [PDF]
, 2009 We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where the objective includes an $\ell_2$ data-fidelity term and a non-smooth ...
Afonso, Manya V. +2 more
core +2 more sources
Algorithms, 2022 There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers.
Aleksey I. Pakhomchik +3 more
doaj +1 more source
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem [PDF]
, 2008 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
f-Flip strategies for unconstrained binary quadratic programming [PDF]
, 2015 Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints.
F. Glover, J.K. Hao
core +4 more sources
Gaussian Mean Fields Lattice Gas
, 2018 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
Ortalama-varyans portföy optimizasyonunda genetik algoritma uygulamaları üzerine bir literatür araştırması [PDF]
, 2017 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
Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver
Frontiers in Applied Mathematics and Statistics, 2023 The aim of this study was to explore the information disclosure (ID) problem, which involves selecting pairs of two sides before matching toward user-oriented optimization. This problem is known to be useful for mobility-on-demand (MoD) platforms because
Keisuke Otaki +2 more
doaj +1 more source
Particle algorithms for optimization on binary spaces
, 2011 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
, 2020 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