Suchergebnisse - constrained binary quadratic programming ((problem OR problemysas) OR problemysas)~

Mining for diamonds—Matrix generation algorithms for binary quadratically constrained quadratic problems von 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 …”
Volltext

QPLIB: a library of quadratic programming instances von 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 …”
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

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

Digital Annealing Engine for High-speed Solving of Constrained Binary Quadratic Problems on Multiple GPUs von 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 …”
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

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

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

A quadratic simplex algorithm for primal optimization over zero-one polytopes von 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 …”
Volltext

A Quantum Approach for Stochastic Constrained Binary Optimization von Gupta, Sarthak, Kekatos, Vassilis

“… To this end, this work puts forth a quantum heuristic to cope with stochastic binary quadratically constrained quadratic programs (QCQP …”
Volltext

Machine-Cell and Part-Family Formation via Neurodynamics-Driven Constrained Binary Matrix Factorization von Li, Hongzong, Wang, Jun

“… A constrained binary matrix factorization problem is formulated for machine-cell and part-family formation to minimize the number of exceptional elements (EEs …”
Volltext

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

“… Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method …”
Volltext

Symmetry Detection for Quadratic Optimization Using Binary Layered Graphs von Kouyialis, Georgia, Wang, Xiaoyu, Misener, Ruth

“… , of branch-and-bound when symmetry induces many equivalent branches. This paper develops detection methods for symmetry groups in quadratically-constrained quadratic optimization problems …”
Volltext

Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction von Berahas, Albert S., Shi, Jiahao, Yi, Zihong, Zhou, Baoyu

“… In this paper, we propose a stochastic method for solving equality constrained optimization problems that utilizes predictive variance reduction …”
Volltext

A Quantum Annealing Algorithm for the Resource-Constrained Excavator Procurement Problem von Chang, Linhao, Xu, Meng, Guo, Lifei, Zhu, XiHong, Qin, Shujin, Guo, XiWang, Yang, Xinyi

“… A mixed integer programming model (MIP) is established to address the RCEPP. In line with the specifications of quantum computers, a quadratic unconstrained binary optimization model is developed via reformulating the MIP …”
Volltext

Dantzig–Wolfe reformulations for binary quadratic problems von Ceselli, Alberto, Létocart, Lucas, Traversi, Emiliano

“… The purpose of this paper is to provide strong reformulations for binary quadratic problems …”
Volltext

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

A distributionally robust chance-constrained kernel-free quadratic surface support vector machine von Lin, Fengming, Fang, Shu-Cherng, Fang, Xiaolei, Gao, Zheming, Luo, Jian

“… A distributionally robust chance-constrained kernel-free quadratic surface support vector machine (SVM) model is proposed using the moment information of the uncertain data …”
Volltext

A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters von 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 …”
Volltext

A Sparsity‐Driven Solution Method for the Cardinality Constrained Mean‐Variance Portfolio Selection Problem von Jiang, Shan, Fang, Shu‐Cherng, An, Qi

“… Cardinality constrained mean‐variance (CCMV) portfolio selection problem is commonly formulated as a mixed integer quadratic program (MIQP …”
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