Search Results - "Unconstrained binary quadratic programming"

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…”
Get full text

Path relinking for unconstrained binary quadratic programming by 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…”
Get full text

An Evolutionary Ising Optimization Framework for Unconstrained Binary Quadratic Programming by Fu, Wujie, Trivedi, Anupam, Chen, Guanyu, Gao, Yuan, Srinivasan, Dipti, Danner, Aaron

“…An Ising machine (IM), as a type of analog computer tailored for tackling intractable combinatorial optimization problems, has attracted remarkable attention…”
Get full text

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming by Huo, Xinyue, Gu, Ran

“…The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in combinatorial optimization, circuit design, and other fields…”
Get full text

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

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

A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming by Liefooghe, Arnaud, Verel, Sébastien, Hao, Jin-Kao

“…•We extend conventional single-objective 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. However, these algorithms usually perform differently from one problem to…”
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

f-Flip strategies for unconstrained binary quadratic programming by Glover, Fred, Hao, Jin-Kao

“…Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints…”
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

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

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

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

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

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming by Merz, Peter, Freisleben, Bernd

“…In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP…”
Get full text