Výsledky vyhledávání - "unconstrained binary quadratic programming"

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

Path relinking for unconstrained binary quadratic programming Autor 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…”
Získat plný text

An Evolutionary Ising Optimization Framework for Unconstrained Binary Quadratic Programming Autor 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…”
Získat plný text

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming Autor 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…”
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 model of unconstrained binary quadratic programming (UBQP…”
Získat plný text

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

“…•We extend conventional single-objective unconstrained binary quadratic programming (UBQP…”
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

f-Flip strategies for unconstrained binary quadratic programming Autor 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…”
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

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

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

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming Autor 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…”
Získat plný text