Results 51 to 60 of about 22,651 (215)
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
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
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
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
Eine Heuristik für quadratische 0-1-Probleme [PDF]
, 2008 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
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
Multi-Objective Optimization Technique Based on QUBO and an Ising Machine
IEEE AccessWith 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
, 2016 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
Advanced Intelligent Systems, EarlyView.Legged robots have advanced in environmental interaction through contact, but most works rely on fixed contact sequences. This work presents a new method based on an indirect optimization method for legged robots to automatically generate contact sequences for complex movements.
Yaowei Chen, Jie Zhang, Ming Lyu
wiley +1 more source
, 2010 Several portfolio selection models take into account practical limitations on the number of assets to include and on their weights in the portfolio.
A Fernández +47 more
core +1 more source