Suchergebnisse - "Unconstrained Binary Quadratic Programming"

PPLS/D: Parallel Pareto Local Search Based on Decomposition von Shi, Jialong, Zhang, Qingfu, Sun, Jianyong

“… Pareto local search (PLS) is a basic building block in many metaheuristics for a multiobjective combinatorial optimization problem. In this paper, an enhanced …”
Volltext

Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization von Chen, Ming, Chen, Yuning, Du, Yonghao, Wei, Luona, Chen, Yingwu

“… The unconstrained binary quadratic programming (UBQP) problem is a difficult combinatorial optimization problem that has been intensively studied in the past …”
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

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.

“… •We propose two closed-form formulas to quickly reevaluate r-flip moves.•Algorithms are designed which are simple to implement and fast to compute.•We test our …”
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) to the multiobjective case.•We define a flexible model to generate …”
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 note on heuristic approach based on UBQP formulation of the maximum diversity problem von Alidaee, Bahram, Wang, Haibo

“… The maximum diversity problem (MDP) is a challenging NP-hard problem with a wide range of real applications. Several researchers have pointed out close …”
Volltext

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

“… ► This paper combines a tabu Hopfield neural network (THNN) with estimation of distribution algorithm (EDA) for combinatorial optimization problems. ► The …”
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 proposes an estimation of distribution algorithm (EDA) vaccination, as hypermutation and recombination operator, to effectively use the global …”
Volltext

SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances von Grippo, Luigi, Palagi, Laura, Piacentini, Mauro, Piccialli, Veronica, Rinaldi, Giovanni

“… We consider low-rank semidefinite programming (LRSDP) relaxations of unconstrained quadratic problems (or, equivalently, of Max-Cut problems) that can be …”
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 …”
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. It is a well known NP-hard problem and is a unified …”
Volltext

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem von Zhou, Ying, Wang, Jiahai, Yin, Jian

“… ► This paper first proposes an annealing HNN (AHNN) that permits temporary energy ascent to help the HNN escape from local minima. ► From a cooperative …”
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. This paper presents a simulated …”
Volltext

An unconstrained binary quadratic programming for the maximum independent set problem von Sidi Mohamed Douiri, Souad Elbernoussi

“… For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which …”
Volltext

On the Effects of Smoothing Rugged Landscape by Different Toy Problems: A Case Study on UBQP von Wang, Wei, Shi, Jialong, Sun, Jianyong, Liefooghe, Arnaud, Zhang, Qingfu, Fan, Ye

“… The hardness of the Unconstrained Binary Quadratic Program (UBQP) problem is due its rugged landscape. Various algorithms have been proposed for UBQP, …”
Volltext

Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming von Sharma, Aasish Kumar, Prashad Pandey, Sanjeeb, Kunkel, Julian Martin

“… Convolutional Neural Networks (CNNs) are pivotal in computer vision and Big Data analytics but demand significant computational resources when trained on …”
Volltext

An Improved Harmony Search Based on Teaching-Learning Strategy for Unconstrained Binary Quadratic Programming von Yong, Longquan

“… Unconstrained binary quadratic programming (UBQP) problem plays an important role in operational research due to its application potential and its …”
Volltext

Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm von Lei Song, Rong-Qiang Zeng, Yang Wang, Ming-Sheng Shang

“… This paper investigates a multi-objective path relinking algorithm in order to optimize a bi-objective unconstrained binary quadratic programming problem. In …”
Volltext

Multiobjective Binary ACO for Unconstrained Binary Quadratic Programming von De Souza, Murilo Zangari, Pozo, Aurora Trinidad Ramirez

“… The Unconstrained Binary Quadratic Programming (UBQP) is a NP-hard problem able to represent a wide range of combinatorial optimization problems. The problem …”
Volltext