Suchergebnisse - constrained binary quadratic programming problems*

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

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

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints.

Autoren: GUSMEROLI, NICOLÒ HRGA, TIMOTEJ LUŽAR, BORUT et al.

Quelle: ACM Transactions on Mathematical Software. Jun2022, Vol. 48 Issue 2, p1-31. 31p.

Schlagwörter: *SEMIDEFINITE programming, *PARALLEL algorithms, *QUADRATIC programming, *PROBLEM solving, *ALGORITHMS, *COMPUTERS

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

Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction.

Autoren: Berahas, Albert S. Shi, Jiahao Yi, Zihong et al.

Quelle: Computational Optimization & Applications. Sep2023, Vol. 86 Issue 1, p79-116. 38p.

Schlagwörter: *ALGORITHMS, QUADRATIC programming, MACHINE learning

A fast global algorithm for multi-linearly constrained separable binary quadratic program.

Autoren: Qu, Guangtai Li, Shaoze Deng, Zhibin et al.

Quelle: Journal of Industrial & Management Optimization. Feb2025, Vol. 21 Issue 2, p1-18. 18p.

Schlagwörter: *PROBLEM solving, *ALGORITHMS, QUADRATIC programming

ON INTEGRALITY IN SEMIDEFINITE PROGRAMMING FOR DISCRETE OPTIMIZATION.

Autoren: DE MEIJER, FRANK SOTIROV, RENATA

Quelle: SIAM Journal on Optimization. 2024, Vol. 34 Issue 1, p1071-1096. 26p.

Schlagwörter: SEMIDEFINITE programming, QUADRATIC assignment problem, CONSTRAINT programming

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

A quadratic simplex algorithm for primal optimization over zero-one polytopes.

Autoren: Mallach, Sven¹ (AUTHOR) smallach@cs.uni-bonn.de

Quelle: Discrete Applied Mathematics. Apr2024, Vol. 347, p285-296. 12p.

Schlagwörter: *SIMPLEX algorithm, *QUADRATIC assignment problem, *POLYTOPES, *QUADRATIC programming, *PROOF of concept

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

Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming.

Autoren: Xiaojin Zheng Xiaoling Sun Duan Li et al.

Quelle: Mathematics of Operations Research; Nov2010, Vol. 35 Issue 4, p864-880, 17p

Schlagwörter: QUADRATIC programming, NONLINEAR programming, BINARY control systems, LAGRANGIAN functions, DUALITY (Logic)

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

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Autoren: Wang, Jiahai Zhou, Ying Yin, Jian

Quelle: Expert Systems with Applications. Nov2011, Vol. 38 Issue 12, p14870-14881. 12p.

Schlagwörter: *ARTIFICIAL neural networks, *DISTRIBUTION (Probability theory), *CONSTRAINED optimization, *QUADRATIC programming, *BINARY number system, *NP-complete problems, *SEARCH algorithms, *HEURISTIC algorithms

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

Exploiting Hardware and Software Advances for Quadratic Models of Wind Farm Layout Optimization

Autoren: Arik Senderovich Jiachen Zhang Eldan Cohen et al.

Quelle: IEEE Access, Vol 10, Pp 78044-78055 (2022)

Schlagwörter: Quadratic unconstrained binary optimization (QUBO), quadratic programming (QP), digital annealing, wind farm layout optimization (WFLO), Electrical engineering. Electronics. Nuclear engineering, TK1-9971

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/c4c1a287498141298995c455ea8141e5

On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems.

Autoren: Engau, Alexander Anjos, MiguelF. Vannelli, Anthony

Quelle: Optimization Methods & Software. Jun2012, Vol. 27 Issue 3, p539-559. 21p.

Schlagwörter: *INTERIOR-point methods, *BINARY number system, *SEMIDEFINITE programming, *RELAXATION methods (Mathematics), *MATHEMATICAL variables, *ALGORITHMS, *PROBLEM solving, *COMBINATORIAL optimization