Search Results - constrained binary quadratic programming problems~

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems by 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…”
Get full text

On linearization techniques for budget-constrained binary quadratic programming problems by 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…”
Get full text

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem by 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…”
Get full text

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

“…Binary quadratic programming (BQP) is a typical integer programming problem widely applied in the field of signal processing, economy, management and engineering…”
Get full text

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)

Get full text

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)

Get full text

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)

Get full text

A subgradient approach for constrained binary optimization via quantum adiabatic evolution by 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…”
Get full text

Mining for diamonds—Matrix generation algorithms for binary quadratically constrained quadratic problems by Bettiol, Enrico, Bomze, Immanuel, Létocart, Lucas, Rinaldi, Francesco, Traversi, Emiliano

“…In this paper, we consider binary quadratically constrained quadratic problems and propose a new approach to generate stronger bounds than the ones obtained using the Semidefinite Programming relaxation…”
Get full text

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

“… We model the problem…”
Get full text

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

“…A key aspect of the design of a wind farm is the wind farm layout optimization (WFLO) problem: given a wind farm site and information about the wind patterns…”
Get full text

A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters by Lu, Cheng, Wu, Junhao, Deng, Zhibin, Li, Shaoze

“…The singly linearly constrained separable binary quadratic programming problem (SLSBQP) has a wide variety of applications in practice…”
Get full text

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds by Xu, Zi, Hong, Ming-Yi

“…This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance…”
Get full text

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

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

QPLIB: a library of quadratic programming instances by Furini, Fabio, Traversi, Emiliano, Belotti, Pietro, Frangioni, Antonio, Gleixner, Ambros, Gould, Nick, Liberti, Leo, Lodi, Andrea, Misener, Ruth, Mittelmann, Hans, Sahinidis, Nikolaos V., Vigerske, Stefan, Wiegele, Angelika

“…This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed…”
Get full text

Digital Annealing Engine for High-speed Solving of Constrained Binary Quadratic Problems on Multiple GPUs by Katayama, Kentaro, Yoneoka, Noboru, Kanda, Kouichi, Tamura, Hirotaka, Nakayama, Hiroshi, Watanabe, Yasuhiro

“…This paper presents a digital annealing engine capable of high-speed solving the Binary Quadratic Programming Problem (BQP…”
Get full text

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

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

Solving constrained quadratic binary problems via quantum adiabatic evolution by Ronagh, Pooya, Woods, Brad, Iranmanesh, Ehsan

“…Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained…”
Get full text

Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs by Xu, Zi, Hong, Mingyi, Luo, Zhi-Quan

“…) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance…”
Get full text

A quadratic simplex algorithm for primal optimization over zero-one polytopes by Mallach, Sven

“… Computational experiments for unconstrained binary quadratic programs, maximum cut, and the quadratic assignment problem serve as a proof of concept and underline the importance of a pivoting rule…”
Get full text