Výsledky vyhledávání - multi-objective unconstrained binary quadratic programming problems*

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

“…). This paper proposes a selection hyper-heuristic based algorithm for multi-objective optimization problems…”
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

Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm Autor 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…”
Získat plný text

A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem Autor Ying Zhou, Jiahai Wang, Jian Yin

“…Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function…”
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

A Decomposition-Based Multi-Objective Tabu Search Algorithm for Tri-Objective Unconstrained Binary Quadratic Programming Problem Autor Ying Zhou

“…Unconstrained binary quadratic programming problem (UBQP) is a well-known NP hard problem that consists in maximizing a quadratic 0-1 function…”
Získat plný text

Multi-objectivization inspired metaheuristics for the sum-of-the-parts combinatorial optimization problems Autor Shi, Jialong, Sun, Jianyong, Zhang, Qingfu

“… This paper focuses on multi-objectivizing the sum-of-the-parts combinatorial optimization problems, which include the traveling salesman problem, the unconstrained binary quadratic programming…”
Získat plný text

Neuro-PLS: A Generalizable Local Search Framework for Multi-objective Combinatorial Optimization Autor Zhang, Haotian, Shi, Jialong, Sun, Jianyong, Zhang, Qingfu, Xu, Zongben

“…) and the neighborhood-exploration component is guided by a multi-layer perception. In the experimental studies, the training set of Neuro-PLS contains only one 200-dimensional multi-objective unconstrained binary quadratic programming (mUBQP) instance…”
Získat plný text

Multi-objectivization Inspired Metaheuristics for the Sum-of-the-Parts Combinatorial Optimization Problems Autor Shi, Jialong, Sun, Jianyong, Zhang, Qingfu

“… This paper focuses on multi-objectivizing the sum-of-the-parts combinatorial optimization problems, which include the traveling salesman problem, the unconstrained binary quadratic programming…”
Získat plný text