-
221
Organic Memristor‐Based Flexible Neural Networks with Bio‐Realistic Synaptic Plasticity for Complex Combinatorial Optimization
Published 2023-07-01Subjects: Get full text
Article -
222
-
223
-
224
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
Published 2015“…In this paper, we present a general framework for designing approximation schemes for combinatorial optimization problems in which the objective function is a combination of more than one function. …”
Get full text
Get full text
Article -
225
A noisy chaotic neural network for solving combinatorial optimization problems : stochastic chaotic simulated annealing
Published 2012“…Recently Chen and Aihara have demonstrated both experimentally and mathematically that their chaotic simulated annealing (CSA) has better search ability for solving combinatorial optimization problems compared to both the Hopfield-Tank approach and stochastic simulated annealing (SSA). …”
Get full text
Get full text
Journal Article -
226
The retrace traveling salesman problem : a new extension of traveling salesman problem [microfilm] /
Published 2003Subjects: “…Combinatorial optimization…”
-
227
Genetic algorithms in search, optimization, and and machine learning /
Published 1989Subjects: “…Combinatorial optimization…”
-
228
-
229
The retrace traveling salesman problem : a new extension of traveling salesman problem /
Published 2003Subjects: “…Combinatorial optimization…”
-
230
-
231
The retrace traveling salesman problem : a new extension of traveling salesman problem [compact disc] /
Published 2003Subjects: “…Combinatorial optimization…”
-
232
A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
Published 2016-08-01Subjects: Get full text
Article -
233
Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems
Published 2014-01-01“…Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. …”
Get full text
Article -
234
Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems
Published 2024-01-01“…Abstract This article critically investigates the limitations of the simulated annealing algorithm using probabilistic bits (pSA) in solving large-scale combinatorial optimization problems. The study begins with an in-depth analysis of the pSA process, focusing on the issues resulting from unexpected oscillations among p-bits. …”
Get full text
Article -
235
-
236
Pairs-Trading System Using Quantum-Inspired Combinatorial Optimization Accelerator for Optimal Path Search in Market Graphs
Published 2023-01-01Subjects: Get full text
Article -
237
A bi-subpopulation coevolutionary immune algorithm for multi-objective combinatorial optimization in multi-UAV task allocation
Published 2025-01-01Subjects: “…Multi-objective combinatorial optimization…”
Get full text
Article -
238
Hybrid Parallel Ant Colony Optimization for Application to Quantum Computing to Solve Large-Scale Combinatorial Optimization Problems
Published 2023-10-01“…The technique is based on unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. The QAOA was explored in the context of several optimization problems such as the Max-Cut problem and the Traveling Salesman Problem (TSP). …”
Get full text
Article -
239
-
240