Suchergebnisse - Unconstrained binary quadratic programming problem~

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

The unconstrained binary quadratic programming problem: a survey von 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 …”
Volltext

A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem von 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 …”
Volltext

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

“… Metaheuristics have been widely utilized for solving NP-hard optimization problems …”
Volltext

Lagrangean decompositions for the unconstrained binary quadratic programming problem von 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 …”
Volltext

A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem von 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 …”
Volltext

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

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

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

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem von 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 …”
Volltext

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

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

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

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

Memetic algorithms for the unconstrained binary quadratic programming problem von 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 …”
Volltext

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

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

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem von 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 …”
Volltext

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

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

Path relinking for unconstrained binary quadratic programming von Wang, Yang, Lü, Zhipeng, Glover, Fred, Hao, Jin-Kao

“… This paper presents two path relinking algorithms to solve the unconstrained binary quadratic programming (UBQP) problem …”
Volltext

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem von Katayama, Kengo, Narihisa, Hiroyuki

“… The unconstrained binary quadratic programming problem (BQP) is known to be NP-hard and has many practical applications …”
Volltext

Solving unconstrained binary quadratic programming problem by global equilibrium search von Shylo, V.P, Shylo, O.V

“… A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem …”
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

A Method for Large Scale Unconstrained Binary Quadratic Programming Problem Based on Graph Neural Network von Huang, Jiajia, Gu, Shenshen

“… obvious. Under this background, this paper demonstrates a method based on GNNs to solve large-scale Unconstrained 0-1 Quadratic Programming (UBQP) problems …”
Volltext