Suchergebnisse - Unconstrained binary quadratic programming~

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

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

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

“… ); it comprises a unique Ising algorithm and a hybrid annealing scheme, which together are well-suited for solving quadratic unconstrained binary optimization (QUBO …”
Volltext

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming von 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 …”
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

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

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

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. However, these algorithms usually perform differently from one problem to …”
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

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

Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking von Brubaker, J. Kyle, Booth, Kyle E. C., Arakawa, Akihiko, Furrer, Fabian, Ghosh, Jayeeta, Sato, Tsutomu, Katzgraber, Helmut G.

“… In this work, we explore modeling and solving this problem with the quantum-amenable quadratic unconstrained binary optimization (QUBO) formalism …”
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

New approach to solve unconstrained binary quadratic problem von Rabih, Battikh, Hassan, Alabboud, Bassem, Jida, Adnan, Yassine

“… This paper addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0 − 1 variables …”
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