Suchergebnisse - constrained binary quadratic programming (((problem OR problemy) OR problems.as) OR problems.as)~

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

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

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: Gu, Shenshen Cui, Rui Peng, Jiao

Quelle: Neurocomputing. Jul2016, Vol. 198, p171-179. 9p.

Schlagwörter: *POLYNOMIAL time algorithms, *QUADRATIC programming, *INTEGER programming, *SIGNAL processing, *NP-hard problems

Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming

Autoren: Zheng, Xiaojin Sun, Xiaoling Li, Duan et al.

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

Zugangs-URL: https://www.jstor.org/stable/40985290

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

Binary Conic Quadratic Knapsacks

Autoren: Bhardwaj, Avinash

Schlagwörter: Operations research, Applied mathematics, Conic Quadratic Programming, Knapsack Set, Network Design under Uncertainty, Submodular Functions

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/8zj7p436
https://escholarship.org/content/qt8zj7p436/qt8zj7p436.pdf

Multi-Period Quadratic Programs for Hybrid Affine Systems

Autoren: Lee, Jisun

Schlagwörter: Operations research, Industrial engineering, Engineering, complexity, convexification, hybrid system, mixed-integer quadratic program

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/8zs5p5d7
https://escholarship.org/content/qt8zs5p5d7/qt8zs5p5d7.pdf

On linearization techniques for budget-constrained binary quadratic programming problems.

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

Quelle: Operations Research Letters. Nov2016, Vol. 44 Issue 6, p702-705. 4p.

Schlagwörter: *BUDGET, *LINEAR programming, *PROBLEM solving, QUADRATIC programming, BINARY number system

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

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

A column generation approach for the unconstrained binary quadratic programming problem

Autoren: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

Quelle: European Journal of Operational Research. Feb2012, Vol. 217 Issue 1, p69-74. 6p.

Schlagwörter: *NONLINEAR programming, *LINEAR statistical models, *MATHEMATICAL analysis, QUADRATIC programming, CONSTRAINED optimization, GRAPH theory, PARTITIONS (Mathematics), MATHEMATICAL variables

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: *NONLINEAR programming, QUADRATIC programming, BINARY control systems, LAGRANGIAN functions, DUALITY (Logic)

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

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