Výsledky vyhľadávania - constrained binary quadratic programming (problems OR problems)*

Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer

Method and system for solving the lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer

METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A CONSTRAINED BINARY QUADRATIC PROGRAMMING PROBLEM USING A QUANTUM ANNEALER

METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A CONSTRAINED BINARY QUADRATIC PROGRAMMING PROBLEM USING A QUANTUM ANNEALER

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Autori: Jiao Peng Rui Cui Shenshen Gu

Zdroj: Neurocomputing. 198:171-179

Predmety: 0211 other engineering and technologies, 02 engineering and technology

Prístupová URL adresa: http://manuscript.elsevier.com/S0925231216003301/pdf/S0925231216003301.pdf
https://www.sciencedirect.com/science/article/pii/S0925231216003301
https://dblp.uni-trier.de/db/journals/ijon/ijon198.html#GuCP16
https://doi.org/10.1016/j.neucom.2015.09.130

Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer

On linearization techniques for budget-constrained binary quadratic programming problems

Autori: Yong Xia Mei-Jia Yang Hui-Min Zou

Zdroj: Operations Research Letters. 44:702-705

Predmety: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/orl/orl44.html#YangXZ16
http://www.sciencedirect.com/science/article/pii/S0167637716300864
https://www.sciencedirect.com/science/article/pii/S0167637716300864

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix

Autori: Shenshen Gu Rui Cui

Zdroj: Fifth International Conference on Intelligent Control and Information Processing. :366-372

Predmety: 0211 other engineering and technologies, 02 engineering and technology

Prístupová URL adresa: https://ieeexplore.ieee.org/abstract/document/7010280
http://ieeexplore.ieee.org/document/7010280/

A Polynomial Time Solvable Algorithm to Linearly Constrained Binary Quadratic Programming Problems with Q being a Tri-Diagonal Matrix

Autori: Shenshen Gu

Zdroj: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences. 3:65-72

Predmety: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: http://www.aicit.org/aiss/global/paper_detail.html?jname=AISS&q=208

Dimensionality reduction for binary quadratic programming problems

Autori: Rabih Battikh Bilal Hammoud Hassan Alabboud a ďalší

METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A CONSTRAINED BINARY QUADRATIC PROGRAMMING PROBLEM USING A QUANTUM ANNEALER

Solving constrained quadratic binary problems via quantum adiabatic evolution

Autori: Ehsan Iranmanesh Pooya Ronagh Brad Woods

Zdroj: Quantum Information and Computation. 16:1029-1047

Predmety: FOS: Computer and information sciences, Quantum Physics, 0211 other engineering and technologies, Computer Science - Emerging Technologies, FOS: Physical sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Emerging Technologies (cs.ET), Optimization and Control (math.OC), 0103 physical sciences, FOS: Mathematics, Quantum Physics (quant-ph), Mathematics - Optimization and Control

Prístupová URL adresa: http://arxiv.org/pdf/1509.05001
http://arxiv.org/abs/1509.05001

METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A CONSTRAINED BINARY QUADRATIC PROGRAMMING PROBLEM USING A QUANTUM ANNEALER

Solving constrained quadratic binary problems via quantum adiabatic evolution

Autori: Ronagh, Pooya Woods, Brad Iranmanesh, Ehsan

Témy: Mathematics - Optimization and Control, Computer Science - Emerging Technologies, Quantum Physics, text

URL: http://arxiv.org/abs/1509.05001

MOCQA: A Multi-Core Optimizer for Constrained Quadratic Assignment

Autori: Mohammad Bagherbeik Parastoo Ashtari Kouichi Kanda a ďalší

Zdroj: IEEE Access, Vol 13, Pp 156870-156890 (2025)

Predmety: Boltzmann machines, combinatorial optimization, constrained quadratic programming evolutionary algorithms, hardware acceleration, parallel compute systems, parallel tempering, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

Popis súboru: electronic resource

Relation: https://ieeexplore.ieee.org/document/11142663/; https://doaj.org/toc/2169-3536

Prístupová URL adresa: https://doaj.org/article/214d1823381547ffae7bf294a0f1cd58

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

Autori: Zhou, Ying Wang, Jiahai Yin, Jian

Zdroj: Expert Systems with Applications. Oct2011, Vol. 38 Issue 11, p13894-13905. 12p.

Predmety: *SIMULATED annealing, *ARTIFICIAL neural networks, *CONSTRAINED optimization, *QUADRATIC programming, *PROBABILITY theory, *INFORMATION technology, *NP-complete problems, *COMBINATORIAL optimization, *SIMULATION methods & models, *HEURISTIC algorithms

Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming

Autori: Zheng, Xiaojin Sun, Xiaoling Li, Duan a ďalší

Zdroj: Mathematics of Operations Research, 2010 Nov 01. 35(4), 864-880.

Prístupová URL adresa: https://www.jstor.org/stable/40985290

Method and system for solving a convex integer quadratic programming problem using a binary optimizer

A Fast Binary Quadratic Programming Solver Based on Stochastic Neighborhood Search.

Autori: Lam, Benson Shu Yan Liew, Alan Wee-Chung

Zdroj: IEEE Transactions on Pattern Analysis & Machine Intelligence; Jan2022, Vol. 44 Issue 1, p32-49, 18p

Predmety: NEIGHBORHOODS, PATTERN recognition systems, IMAGE processing, COMPUTATIONAL complexity, IMAGE reconstruction

METHOD AND SYSTEM FOR SOLVING A CONVEX INTEGER QUADRATIC PROGRAMMING PROBLEM USING A BINARY OPTIMIZER