Výsledky vyhľadávania - (("Binary quadratic programming problemy") OR ("binary quadratic programming problems"))~

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ískať plný text

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ískať plný text

Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems Autor Cai, Yiqiao, Wang, Jiahai, Yin, Jian, Zhou, Yalan

“… ► MCSA-EDA has been shown as a competitive approach for unconstrained binary quadratic programming problems (UBQP…”
Získať plný text

Convex reformulation for binary quadratic programming problems via average objective value maximization Autor Lu, Cheng, Guo, Xiaoling

“… Numerical experimental results show that our reformulation method performs better than the compared methods for certain types of binary quadratic programming problems…”
Získať plný text

A global continuation algorithm for solving binary quadratic programming problems Autor Pan, Shaohua, Tan, Tao, Jiang, Yuxi

“…In this paper, we propose a new continuous approach for the unconstrained binary quadratic programming (BQP) problems based on the Fischer-Burmeister NCP…”
Získať plný text

A heuristic solution to the optimisation of flutter control in compression systems (and to some more binary quadratic programming problems) via ΔΣ modulation circuits Autor Callegari, S, Bizzarri, F

“…An example of how circuit related techniques can help solving optimisatin problems originating from completely different domains is provided. It is shown that…”
Získať plný text

Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis Autor Yildirim, E Alper

“… of mixed binary quadratic programming problems. We provide a characterization of the feasibility of such an inner approximation as well as the optimal value of a feasible inner approximation…”
Získať 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

“… 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…”
Získať plný text

Performance of various methods for the solution of binary quadratic programming problems Autor Hasegawa, F., Luo, J., Pattipati, K., Willett, P.

“…We (2001) previously showed that for solutions of the binary quadratic programming problem there exists an "efficient frontier" in the performance/speed domain among the algorithms which characterizes…”
Získať plný text

Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions Autor Elbassioni, Khaled, Trung Thanh Nguyen

“…Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications…”
Získať plný text

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix Autor Shenshen Gu

“… And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP…”
Získať plný text

The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems Autor Chuan-Hao Guo, Yan-Qin, Bai, Li-Ping, Tang

“…It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be…”
Získať plný text

The unconstrained binary quadratic programming problem: a survey Autor Kochenberger, Gary, Hao, Jin-Kao, Glover, Fred, Lewis, Mark, Lü, Zhipeng, Wang, Haibo, Wang, Yang

“…In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application…”
Získať plný text

Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem Autor Anacleto, Eduardo A.J., Meneses, Cláudio N., Ravelo, Santiago V.

“… The Unconstrained Binary Quadratic Programming problem (UBQP) belongs to the NP-hard class and has become a framework for modeling a variety of combinatorial optimization problems…”
Získať plný text

A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem Autor Gu, Shenshen, Hao, Tao, Yao, Hanmei

“…Combinatorial optimization problems have been widely used in various fields. And many types of combinatorial optimization problems can be generalized into the…”
Získať plný text

Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem Autor Zhou, Ying, Kong, Lingjing, Wu, Ziyan, Liu, Shaopeng, Cai, Yiqiao, Liu, Ye

“…Metaheuristics have been widely utilized for solving NP-hard optimization problems. However, these algorithms usually perform differently from one problem to…”
Získať plný text

A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem Autor Zhou, Ying, Kong, Lingjing, Liu, Yong, Cai, Yiqiao, Liu, Shaopeng

“…The multiobjective unconstrained binary quadratic programming problem is an important combinatorial optimization problem with both theory and practical values…”
Získať plný text

A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem Autor Zhou, Ying, Wang, Jiahai, Wu, Ziyan, Wu, Keke

“…•A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem…”
Získať plný text

Parametric Lagrangian dual for the binary quadratic programming problem Autor Xia, Yong, Xing, Wenxun

“…Based on a difference between convex decomposition of the Lagrangian function, we propose and study a family of parametric Lagrangian dual for the binary…”
Získať plný text

A multi-objective tabu search algorithm based on decomposition for muIti-objective unconstrained binary quadratic programming problem Autor Zhou, Ying, Wang, Jiahai, Wu, Ziyan, Wu, Keke

“…Unconstrained binary quadratic programming problem (UBQP) is a well-known NP-hard problem…”
Získať plný text