Search Results - binary-based combinatorial optimization problems~

Characterization of rankings generated by pseudo-Boolean functions by 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…”
Get full text

A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems by 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…”
Get full text

SubQUBO Annealing Based on Efficient Binary Variable Selection for Combinatorial Optimization Problems with One-Hot Constraints by 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…”
Get full text

Binary matrix factorization via collaborative neurodynamic optimization by 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…”
Get full text

A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems by 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…”
Get full text

Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector by 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…”
Get full text

Grover Adaptive Search With Spin Variables by 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…”
Get full text

Binary Fruit Fly Swarm Algorithms for the Set Covering Problem by 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

Get full text

Modeling and optimization of dedicated bus lanes space allocation in large networks with dynamic congestion by 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…”
Get full text

A Multi-state Gravitational Search Algorithm for Combinatorial Optimization Problems by 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…”
Get full text

An Alternating Minimization Algorithm for Binary Image Restoration by 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…”
Get full text

Training an Artificial Neural Network to Compute the Euler Number of a 2-D Binary Image based on Vertex Chain Codification by 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.,…”
Get full text

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

Get full text

An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems by 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…”
Get full text

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

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

HOBOTAN: Efficient Higher Order Binary Optimization Solver with Tensor Networks and PyTorch by 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…”
Get full text

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

Get full text

Quantum-inspired genetic algorithms applied to ordering combinatorial optimization problems by 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…”
Get full text

Grover Adaptive Search with Spin Variables by 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…”
Get full text

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

“… Furthermore, this study models the feature selection problem…”
Get full text