Suchergebnisse - Binary-constrained quadratic programming

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem von Lu, Cheng, Wang, Zhenbo, Xing, Wenxun

“… This paper presents an improved lower bound and an approximation algorithm based on spectral decomposition for the binary constrained quadratic programming problem …”
Volltext

Semidefinite Programming Relaxation Based Virtually Antipodal Detection for MIMO Systems Using Gray-Coded High-Order QAM von Shaoshi Yang, Tiejun Lv, Hanzo, L.

“… An efficient generalized semidefinite programming relaxation (SDPR) based virtually antipodal (VA …”
Volltext

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint von Zheng, Xiaojin, Pan, Yutong, Cui, Xueting

“… We investigate in this paper nonconvex binary quadratically constrained quadratic programming (QCQP …”
Volltext

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems von Gu, Shenshen, Cui, Rui, Peng, Jiao

“… However, it is NP-hard and lacks efficient algorithms. Due to this reason, in this paper, some novel polynomial algorithms are proposed to solve a class of unconstrained and linearly constrained binary quadratic programming problems …”
Volltext

On linearization techniques for budget-constrained binary quadratic programming problems von Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min

“… Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP …”
Volltext

Semidefinite Programming Relaxation Based Virtually Antipodal Detection for Gray Coded 16-QAM MIMO Signalling von Shaoshi Yang, Hanzo, L.

“… An efficient semidefinite programming relaxation (SDPR) based virtually antipodal (VA …”
Volltext

An evaluation of semidefinite programming based approaches for discrete lot-sizing problems von Gicquel, C., Lisser, A., Minoux, M.

“… •This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation …”
Volltext

US Patent Issued to 1QB INFORMATION TECHNOLOGIES on May 21 for "Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer" (Canadian Inventors)

Volltext

US Patent Issued to 1QB Information Technologies on Oct. 24 for "Method and system for solving the lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer" (Canadian Inventors)

Volltext

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix von Shenshen Gu, Rui Cui

“… However, it's NP-hard and lacks efficient algorithms. Due to this reason, in this paper, a novel polynomial algorithm to linearly constrained binary quadratic …”
Volltext

US Patent Issued to 1QB Information Technologies on Nov. 29 for "Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer" (Canadian Inventors)

Volltext

Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization von KUMAR, DEEPAK, RAMAKRISHNAN, A G

“… In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints …”
Volltext

A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access von Adasme, Pablo, Lisser, Abdel, Soto, Ismael

“… This paper proposes two binary quadratically constrained quadratic programs for minimizing power subject to bit rate and subcarrier allocation constraints over wireless orthogonal frequency division multiple access …”
Volltext

Array spatial thinning for interference mitigation by semidefinite programming von Nosrati, Hamed, Aboutanios, Elias, Smith, David B.

“… This optimization is a binary quadratic non-convex minimization. We propose a semidefinite programming method to find suboptimal solutions using an optimal randomized sampling strategy …”
Volltext

Optimal placement of multi-wavelength integrated tunable transmitters in reconfigurable optical data center interconnection networks with multi-hop routing von Zhu, Jiawen, Chen, Baojun, Sun, Weiqiang, Ye, Tong, Hu, Weisheng

“… Circuit-switched technologies have created the enticing possibility of guaranteeing the performance of data center networks under bursty and skewed traffic. In …”
Volltext

A subgradient approach for constrained binary optimization via quantum adiabatic evolution von Karimi, Sahar, Ronagh, Pooya

“… Outer approximation method has been proposed for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution in the literature …”
Volltext

Sensing Coverage Enhancement of Cellular Networks Via Mutual Interference Suppression von Wang, Bowen, Li, Nanxi, Zhu, Jianchi, She, Xiaoming, Chen, Peng

“… constrained binary quadratic programming instance, accounting for mutual interference among base stations …”
Volltext

Exploiting Hardware and Software Advances for Quadratic Models of Wind Farm Layout Optimization von Senderovich, Arik, Zhang, Jiachen, Cohen, Eldan, Beck, J. Christopher

“… and wake-based interference between turbines. Given the pairwise wake interactions, it is natural to model the energy objective as a quadratic function as, indeed, has been done in some existing optimization approaches …”
Volltext

Switch programming of reflectivity control devices for the coupled dynamics of a solar sail von Hu, Tianjian, Gong, Shengping, Mu, Junshan, Li, Junfeng, Wang, Tianshu, Qian, Weiping

“… Subsequently, the coupled dynamics is reformulated into a constrained quadratic programming and a basic gradient projection method is designed to search for the optimal …”
Volltext

A Non-Iterative Quantum Computation for Karnik-Mendel Algorithms von Pourabdollah, Amir, Mendel, Jerry M.

“… We map the KM problem to the problem of minimising an objective function in the form of a binary constrained quadratic model (CQM …”
Volltext