Search Results - (( binary quadratic programming problem ) OR ( binary quadratic programming problems ))

Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem by 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…”
Get full text

The unconstrained binary quadratic programming problem: a survey by 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 potential and its computational challenge…”
Get full text

A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem by 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 model of unconstrained binary quadratic programming (UBQP…”
Get full text

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

“…Metaheuristics have been widely utilized for solving NP-hard optimization problems…”
Get full text

Lagrangean decompositions for the unconstrained binary quadratic programming problem by Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

“…The unconstrained binary quadratic programming problem (QP) is a classical non‐linear problem of optimizing a quadratic objective by a suitable choice of binary decision variables…”
Get full text

A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem by 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…”
Get full text

A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem by 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…”
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

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems by Gu, Shenshen, Cui, Rui, Peng, Jiao

“…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

Parametric Lagrangian dual for the binary quadratic programming problem by 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 quadratic program…”
Get full text

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

“…Unconstrained binary quadratic programming problem (UBQP) is a well-known NP-hard problem…”
Get full text

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem by Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

“…This paper presents a new alternative of Lagrangian decomposition based on column generation technique to solve the unconstrained binary quadratic programming problem…”
Get full text

A column generation approach for the unconstrained binary quadratic programming problem by Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

“… with clusters to solve the unconstrained binary quadratic programming problem that consists of maximizing…”
Get full text

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem by Wang, Jiahai, Zhou, Ying, Yin, Jian

“…–EDA is tested on unconstrained binary quadratic programming problems and maximum cut problems…”
Get full text

Memetic algorithms for the unconstrained binary quadratic programming problem by Merz, Peter, Katayama, Kengo

“…This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP…”
Get full text

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

“… ► MCSA-EDA has been shown as a competitive approach for unconstrained binary quadratic programming problems (UBQP…”
Get full text

Solving the maximum vertex weight clique problem via binary quadratic programming by Wang, Yang, Hao, Jin-Kao, Glover, Fred, Lü, Zhipeng, Wu, Qinghua

“…In recent years, the general binary quadratic programming (BQP) model has been widely applied to solve a number of combinatorial optimization problems…”
Get full text

Convex reformulation for binary quadratic programming problems via average objective value maximization by 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…”
Get full text

Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem by Wang, Jiahai

“…Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function…”
Get full text

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem by Zhou, Ying, Wang, Jiahai, Yin, Jian

“… ► The proposed CoAHNN is validated on 21 unconstrained binary quadratic programming problems with the size ranging from 3000 to 7000, and 48 maximum cut problems with the size ranging from 512 to 3375…”
Get full text