Výsledky vyhledávání - (("Binary quadratic programming problem") OR ("Binary quadratic programming problems"))~

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ískat 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ískat 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ískat 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ískat 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ískat 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ískat 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í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

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

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

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem Autor 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…”
Získat plný text

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

“…–EDA is tested on unconstrained binary quadratic programming problems and maximum cut problems…”
Získat plný text

Memetic algorithms for the unconstrained binary quadratic programming problem Autor 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…”
Získat plný text

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

“… with clusters to solve the unconstrained binary quadratic programming problem that consists of maximizing…”
Získat 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ískat plný text

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

“…Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function…”
Získat plný text

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem Autor 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…”
Získat plný text

Lagrangean decompositions for the unconstrained binary quadratic programming problem Autor 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…”
Získat 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ískat plný text