Suchergebnisse - binary-based combinatorial optimization problems

Characterization of rankings generated by pseudo-Boolean functions von Unanue, Imanol, Merino, María, Lozano, Jose A.

“… In this paper we pursue the study of pseudo-Boolean functions as ranking generators. The objective of the work is to find new insights between the relation of …”
Volltext

A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems von Unanue, Imanol, Merino, Maria, Lozano, Jose A.

“… In this paper we pursue the use of the Fourier transform for a general analysis of combinatorial optimization problems …”
Volltext

SubQUBO Annealing Based on Efficient Binary Variable Selection for Combinatorial Optimization Problems with One-Hot Constraints von Noguchi, Tatsuya, Fukada, Keisuke, Bao, Siya, Togawa, Nozomu

“… In combinatorial optimization problems with one-hot constraints, the number of binary variables that have the value of one in the feasible solution becomes constant and small, so it is …”
Volltext

Binary matrix factorization via collaborative neurodynamic optimization von Li, Hongzong, Wang, Jun, Zhang, Nian, Zhang, Wei

“… This paper presents a collaborative neurodynamic optimization approach to binary matrix factorization based on the original combinatorial optimization problem formulation and quadratic unconstrained …”
Volltext

A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems von Lemus-Romani, José, Becerra-Rozas, Marcelo, Crawford, Broderick, Soto, Ricardo, Cisternas-Caneo, Felipe, Vega, Emanuel, Castillo, Mauricio, Tapia, Diego, Astorga, Gino, Palma, Wenceslao, Castro, Carlos, García, José

“… Currently, industry is undergoing an exponential increase in binary-based combinatorial problems …”
Volltext

Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector von Becerra-Rozas, Marcelo, Lemus-Romani, José, Cisternas-Caneo, Felipe, Crawford, Broderick, Soto, Ricardo, García, José

“… In recent years, continuous metaheuristics have been a trend in solving binary-based combinatorial problems due to their good results …”
Volltext

Grover Adaptive Search With Spin Variables von Fujiwara, Shintaro, Ishikawa, Naoki

“… This article presents a novel approach to Grover adaptive search (GAS) for a combinatorial optimization problem whose objective function involves spin variables …”
Volltext

Binary Fruit Fly Swarm Algorithms for the Set Covering Problem von Crawford, Broderick, Soto, Ricardo, de la Fuente Mella, Hanns, Elortegui, Claudio, Palma, Wenceslao, Torres-Rojas, Claudio, Vasconcellos-Gaete, Claudia, Becerra, Marcelo, Pe馻, Javier, Misra, Sanjay

Volltext

Modeling and optimization of dedicated bus lanes space allocation in large networks with dynamic congestion von Tsitsokas, Dimitrios, Kouvelas, Anastasios, Geroliminis, Nikolas

“… •Formulating a combinatorial optimization problem for dedicated bus lane (DBL) allocation.•Integrating dynamic characteristics of congestion in the DBL problem …”
Volltext

Noise Robustness of Quantum Relaxation for Combinatorial Optimization von Kentaro Tamura, Yohichi Suzuki, Rudy Raymond, Hiroshi C. Watanabe, Yuki Sato, Ruho Kondo, Michihiko Sugawara, Naoki Yamamoto

Volltext

A Multi-state Gravitational Search Algorithm for Combinatorial Optimization Problems von Ibrahim, Ismail, Ibrahim, Zuwairie, Ahmad, Hamzah, Yusof, Zulkifli Md

“… The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems …”
Volltext

An Alternating Minimization Algorithm for Binary Image Restoration von Zhang, Jianjun

“… The problem we will consider in this paper is binary image restoration. It is, in essence, difficult to solve because of the combinatorial nature of the problem …”
Volltext

Training an Artificial Neural Network to Compute the Euler Number of a 2-D Binary Image based on Vertex Chain Codification von Juan Humberto Sossa Azuela, Arce, Fernando, Gómez, Wilfrido, Lira, Laura

“… So-called Vertex Chain Codes have been widely used to describe the shape of the objects. From these codes, several describing features can be obtained, e.g., …”
Volltext

Partitioning QUBO with two-way one-hot conditions on traveling salesman problems for city distributions with multiple clusters von Akihiro Yatabe

Volltext

An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems von Li, Xiaotong, Fang, Wei, Zhu, Shuwei

“… The 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem that is difficult to solve efficiently based on traditional optimization approaches …”
Volltext

Improved binary gaining–sharing knowledge-based algorithm with mutation for fault section location in distribution networks von Xiong, Guojiang, Yuan, Xufeng, Mohamed, Ali Wagdy, Chen, Jun, Zhang, Jing

“… –1 combinatorial optimization problem with many local optima. An improved binary gaining …”
Volltext

HOBOTAN: Efficient Higher Order Binary Optimization Solver with Tensor Networks and PyTorch von Yasuda, Shoya, Sotobayashi, Shunsuke, Minato, Yuichiro

“… Additionally, by combining techniques such as batch processing for tensor optimization and binary-based integer encoding, we significantly enhance the efficiency of combinatorial optimization …”
Volltext

Quantum-inspired genetic algorithms applied to ordering combinatorial optimization problems von Silveira, L. R., Tanscheit, R., Vellasco, M.

“… ). Classic and quantum-inspired genetic algorithms based on binary representations have been previously used to solve combinatorial optimization problems …”
Volltext

Grover Adaptive Search with Spin Variables von Fujiwara, Shintaro, Ishikawa, Naoki

“… This paper presents a novel approach to Grover adaptive search (GAS) for a combinatorial optimization problem whose objective function involves spin variables …”
Volltext

ALL classification using neural ensemble and memetic deep feature optimization von Awais, Muhammad, Ahmad, Riaz, Kausar, Nabeela, Alzahrani, Ahmed Ibrahim, Alalwan, Nasser, Masood, Anum

“… Furthermore, this study models the feature selection problem …”
Volltext