Results 71 to 80 of about 15,296 (207)
Designing Memristive Materials for Artificial Dynamic Intelligence
Advanced Intelligent Discovery, Volume 2, Issue 1, February 2026.Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley +1 more source
Study of TSP based on self-organizing map
Journal of Measurement Science and Instrumentation, 2013 Self-organizing map（SOM） proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem（TSP）.To improve Kohonen SOM,an effective initialization and parameter modification method is discussed to obtain a faster convergence
SONG Jin-juan +2 more
doaj
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
, 2013 We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.Comment: Superseded by "On the complexity of approximating Euclidean ...
Young, Neal E.
core
IET Optoelectronics, Volume 20, Issue 1, January/December 2026.In this paper, we have reviewed six distinct metaheuristic optimisation algorithms applicable to challenging problems in electromagnetics and optics. Specifically, we applied each method to the synthesis of GMR narrowband reflection filters and performed a systematic comparative evaluation. ABSTRACT The design of optical elements often requires precise
Amirreza Asadollahzadeh +2 more
wiley +1 more source
New Heuristic Approaches for the Min–Max Regret Traveling Salesman Problem
IEEE AccessThe traveling salesman problem (TSP) is widely known as one of the most important NP-hard combinatorial optimization problems. In this paper, we consider the min-max regret traveling salesman problem (MMR-TSP) with interval travel costs. The MMR-TSP aims
Kazuki Hasegawa +2 more
doaj +1 more source
Didactic Visualization of Routing Problems
Education Sciences, 2020 The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj +1 more source
Combinatorial relaxation of the k-traveling salesman problem
, 2016 The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-
Horbach, Andrei
core
Improving the Asymmetric TSP by Considering Graph Structure [PDF]
, 2012 Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP.
Fages, Jean-Guillaume, Lorca, Xavier
core +4 more sources
A New Cooperative Framework for Parallel Trajectory-Based Metaheuristics
, 2018 In this paper, we propose the Parallel Elite Biased framework (PEB framework) for parallel trajectory-based metaheuristics. In the PEB framework, multiple search processes are executed concurrently.
Shi, Jialong, Zhang, Qingfu
core +1 more source