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

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

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

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

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

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

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

Quadratic Unconstrained Binary optimization for the Automotive Paint Shop Problem von Debevere, Pieter, Sugimura, Masahiko, Parizy, Matthieu

“… The Binary Paint Shop Problem (BPSP) is a combinatorial optimization problem which draws inspiration from the automotive paint shop …”
Volltext

Toward Fast Quantum-Classical Hybrid Benders Decomposition for the SCUC Problem: An Efficient Approximate Formulation of QUBOs von Zheng, Xiaodong, Yang, Jiahua, Zhou, Baorong

“… Quantum annealing, which seeks to find the ground state of an Ising model-a minimization of a quadratic binary function-offers potential speedups for solving combinatorial optimization problems …”
Volltext

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems von Kim, Sunyoung, Kojima, Masakazu, Toh, Kim-Chuan

“… We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs …”
Volltext

An Incomplete Observability-Constrained PMU Allocation Problem by Using Mathematical and Evolutionary Algorithms von Theodorakatos, Nikolaos P., Babu, Rohit, Moschoudis, Angelos P.

“… ), a nonlinear program is proposed using Sequential Quadratic Programming (SQP), Interior-Point methods (IPMs) or YALMIP …”
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

KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems von Lu, Cheng, Fang, Shu-Cherng, Jin, Qingwei, Wang, Zhenbo, Xing, Wenxun

“… To find a global optimal solution to the quadratically constrained quadratic programming problem, we explore the relationship between its Lagrangian multipliers and related linear conic programming problems …”
Volltext

Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints von Kim, Sunyoung, Kojima, Masakazu, Toh, Kim-Chuan

“… ) with binary and box constraints. This work is an extension of the work by Kim, Kojima and Toh in 2016 from quadratic optimization problems to POPs …”
Volltext

Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems von Castro, Pedro M., Liao, Qi, Liang, Yongtu

“… Piecewise relaxations are powerful techniques to compute strong dual bounds for (mixed-integer) quadratically constrained problems and provide starting points …”
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

Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions von Jeyakumar, V., Rubinov, A. M., Wu, Z. Y.

“… In this paper, we first examine how global optimality of non-convex constrained optimization problems is related to Lagrange multiplier conditions …”
Volltext

MOCQA: A Multi-Core Optimizer for Constrained Quadratic Assignment von Bagherbeik, Mohammad, Ashtari, Parastoo, Kanda, Kouichi, Tamura, Hirotaka, Sheikholeslami, Ali

“… of domain-specific hardware in this area. Current research has focused on designing accelerators for solving problems in the NP-complete Quadratic Unconstrained Binary Optimization (QUBO …”
Volltext

The quadratic knapsack problem—a survey von Pisinger, David

“… The binary quadratic knapsack problem maximizes a quadratic objective function subject to a linear capacity constraint …”
Volltext

Solving the resource constrained project scheduling problem with quantum annealing von Pérez Armas, Luis Fernando, Creemers, Stefan, Deleplanque, Samuel

“… Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP …”
Volltext