Suchergebnisse - Multi-objective unconstrained binary quadratic programming problem

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

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

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 …”
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

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

“… Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function …”
Volltext

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

“… Unconstrained binary quadratic programming problem (UBQP) is a well-known NP hard problem that consists in maximizing a quadratic 0-1 function …”
Volltext

Neuro-PLS: A Generalizable Local Search Framework for Multi-objective Combinatorial Optimization von 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 …”
Volltext

Diversifying Investments and Maximizing Sharpe Ratio: A Novel Quadratic Unconstrained Binary Optimization Formulation von Mattesi, Mirko, Asproni, Luca, Mattia, Christian, Tufano, Simone, Ranieri, Giacomo, Caputo, Davide, Corbelletto, Davide

“… The incorporation of diversification alongside the Sharpe Ratio into the optimization model creates a joint optimization task, which can be formulated as Quadratic Unconstrained Binary Optimization …”
Volltext

Multi-objectivization inspired metaheuristics for the sum-of-the-parts combinatorial optimization problems von 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 …”
Volltext

Quantum computing approach for multi-objective routing and spectrum assignment optimization von Bouchmal, Oumayma, Cimoli, Bruno, Stabile, Ripalta, Vegas Olmos, Juan Jose, Hernandez-Chulde, Carlos, Martinez, Ricardo, Casellas, Ramon, Tafur Monroy, Idelfonso

“… We first formulate the MO-RSA problem as a quadratic unconstrained binary optimization (QUBO) problem and then solve it using the quantum approximate optimization algorithm …”
Volltext

Walsh-based surrogate-assisted multi-objective combinatorial optimization: A fine-grained analysis for pseudo-boolean functions von Derbel, Bilel, Pruvost, Geoffrey, Liefooghe, Arnaud, Verel, Sébastien, Zhang, Qingfu

“… ) the strategy used to setup the Walsh order hyper-parameter. Based on extensive experiments using two benchmark problems, namely bi-objective NK-landscapes and unconstrained …”
Volltext

Multi-Objective Optimization Technique Based on QUBO and an Ising Machine von Ikeda, Hiroshi, Yamazaki, Takashi

“… , which is a quadratic unconstrained binary optimization-specific solver. We demonstrated the effectiveness of the proposed method by solving a real-world problem with a nonconvex …”
Volltext

Applying Ising Machines to Multi-objective QUBOs von Ayodele, Mayowa, Allmendinger, Richard, López-Ibáñez, Manuel, Liefooghe, Arnaud, Parizy, Matthieu

“… Multi-objective optimisation problems involve finding solutions with varying trade-offs between multiple and often conflicting objectives …”
Volltext

Multi-Objective Quantum Power System Redispatch von Lee, Loong Kuan, Gerlach, Thore, Knaute, Johannes, Gerhardt, Florian, Volker, Patrick, Maras, Tomislav, Dotterweich, Alexander, Piatkowski, Nico

“… In this work, we re-interpret the redispatch problem as a multi-objective combinatorial optimization task within the Quadratic Unconstrained Binary Optimization (QUBO …”
Volltext

Multi-objectivization Inspired Metaheuristics for the Sum-of-the-Parts Combinatorial Optimization Problems von 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 …”
Volltext

On the Average Cost and Latency of Migration to the Next Generation of Networks von Javad-Kalbasi, Mohammad, Kobayashi, Mikinori, Matsumura, Hidetoshi, Sugimura, Masahiko, Wang, Xi, Palacharla, Paparao, Valaee, Shahrokh

“… First, We derive binary linear program and binary quadratic program formulations for average latency and average …”
Volltext

Using Quantum Annealing to Solve Large-Scale Optimization Problems in Logistics and Scheduling von Kumar, Sandeep

“… In planning and scheduling, large-scale optimization problems often have complex limits and a lot of factors, which makes them hard to answer with standard methods …”
Volltext

Petri net-based QUBO Model Formulation for Multi-Resource Flow-Shop Scheduling Problems von Uechi, Ryota, Nakamura, Morikazu, Shiroma, Tadashi, Nakachi, Takayuki

“… (Quadratic Unconstrained Binary Optimization) model. Our approach mitigates the complexity of formulating the QUBO model by employing Petri net theory, providing a more efficient solution for these inherently complex problems …”
Volltext