Výsledky vyhledávání - constrained binary quadratic programming problems*

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems Autor 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…”
Získat plný text

On linearization techniques for budget-constrained binary quadratic programming problems Autor 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…”
Získat plný text

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem Autor 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…”
Získat plný text

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix Autor 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…”
Získat plný 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)

Získat plný 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)

Získat plný 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)

Získat plný text

Optimal placement of multi-wavelength integrated tunable transmitters in reconfigurable optical data center interconnection networks with multi-hop routing Autor 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…”
Získat plný text

A subgradient approach for constrained binary optimization via quantum adiabatic evolution Autor 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…”
Získat plný text

Exploiting Hardware and Software Advances for Quadratic Models of Wind Farm Layout Optimization Autor 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…”
Získat plný text

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

“… constrained binary quadratic programming instance, accounting for mutual interference among base stations…”
Získat plný text

A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters Autor 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…”
Získat plný text

Mining for diamonds—Matrix generation algorithms for binary quadratically constrained quadratic problems Autor 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…”
Získat plný text

Max-min Rate Deployment Optimization for Backhaul-limited Robotic Aerial 6G Small Cells Autor Liao, Yuan, Friderikos, Vasilis

“…To overcome the limited on-board battery issue of nominal airborne base stations (ABSs), we are exploring the use of robotic airborne base station (RABS) with…”
Získat plný text

On Large-Scale SDPS and Their Applications on Branch-and-Bound Algorithms for Binary QCQPS and QAPS Autor Lian, Kristo Nugraha

“… the conventional limit imposed by scaling issues. In particular, we focus on SDP relaxation approaches for the NP-hard class of quadratically constrained quadratic…”
Získat plný text

Max-min Rate Deployment Optimization for Backhaul-limited Robotic Aerial 6G Small Cells Autor Liao, Yuan, Friderikos, Vasilis

“…To overcome the limited on-board battery issue of nominal airborne base stations (ABSs), we are exploring the use of robotic airborne base station (RABS) with…”
Získat plný text

A Subgradient Approach for Constrained Binary Optimization via Quantum Adiabatic Evolution Autor Karimi, Sahar, Ronagh, Pooya

“…An earlier work [18] proposes a method for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution using an outer approximation method…”
Získat plný text

Global optimization for large‐scale water network synthesis based on dynamic partition and adaptive bound tightening Autor Zhou, Wenjin, Liu, Linlin, Du, Jian

“…‐integer quadratic constrained programming (MIQCP) or QCP problems. With the complexity arising from bilinear terms in modeling mass flows of contaminants and binary…”
Získat plný text

Essays in Large Scale Optimization Algorithm and Its Application in Revenue Management Autor Zhu, Mingxi

“… It comprises three chapters. Chapter 1, Managing Randomization in the Multi-Block Alternating Direction Method of Multipliers for Quadratic Optimization, provides theoretical foundations for managing randomization in the multi…”
Získat plný text

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds Autor 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…”
Získat plný text