Suchergebnisse - constrained binary quadratic programming (((problems OR problemy) OR 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

Autoren: Jiao Peng Rui Cui Shenshen Gu

Quelle: Neurocomputing. 198:171-179

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: 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

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

Quelle: Operations Research Letters. 44:702-705

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: 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

Autoren: Shenshen Gu Rui Cui

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

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: 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

Autoren: Shenshen Gu

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

Schlagwörter: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: http://www.aicit.org/aiss/global/paper_detail.html?jname=AISS&q=208

Dimensionality reduction for binary quadratic programming problems

Autoren: Rabih Battikh Bilal Hammoud Hassan Alabboud et 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

Autoren: Ehsan Iranmanesh Pooya Ronagh Brad Woods

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

Schlagwörter: 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

Zugangs-URL: 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

Autoren: Ronagh, Pooya Woods, Brad Iranmanesh, Ehsan

Index Begriffe: 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

Autoren: Mohammad Bagherbeik Parastoo Ashtari Kouichi Kanda et al.

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

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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/214d1823381547ffae7bf294a0f1cd58

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

Autoren: Zhou, Ying Wang, Jiahai Yin, Jian

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

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

A COMPUTATIONAL STUDY ON THE GLOBAL SOLUTION OF NONCONVEX QUADRATIC CONSTRAINTS AND QUADRATIC PROGRAMMING PROBLEMS

Autoren: Sahoo, Nirakar Nayak, Rupaj Kumar

Quelle: Pesquisa Operacional, Volume: 45, Article number: e294445, Published: 08 AUG 2025. August 2025

Schlagwörter: 0-1 QCQP, semidefinite programming, low-rank factorization, nonconvex QCQP

Dateibeschreibung: text/html

Zugangs-URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382025000100225&lng=en&tlng=en

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

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

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

Schlagwörter: 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

Hash Bit Selection via Collaborative Neurodynamic Optimization With Discrete Hopfield Networks.

Autoren: Li, Xinqi Wang, Jun Kwong, Sam

Quelle: IEEE Transactions on Neural Networks & Learning Systems; Oct2022, Vol. 33 Issue 10, p5116-5124, 9p

Schlagwörter: HOPFIELD networks, QUADRATIC programming, QUADRATIC forms, LINEAR programming, PROBLEM solving, SYMMETRIC matrices