Information Bottleneck-Enhanced Reinforcement Learning for Solving Operation Research Problems. [PDF]
Xi R, Ni Y, Wu W.
europepmc +1 more source
Traveling salesman problem solution using magnonic combinatorial device. [PDF]
Balinskyy M, Khitun A.
europepmc +1 more source
A Branch and Bound Algorithm to Solve Travelling Salesman Problem (TSP) with Uncertain Parameters
S. Dhanasekar +2 more
openaire +1 more source
A parallel magnetic tunnel junction-based probabilistic Ising processor for efficient quadratic optimization. [PDF]
Yang S +4 more
europepmc +1 more source
The analysis carried out is an analysis aimed at finding a solution to the problem of the Traveling Salesman Problem (TSP) using a revolutionary algorithm.
Batubara, Muhammad Taufik
core
Information-Theoretic Intrinsic Motivation for Reinforcement Learning in Combinatorial Routing. [PDF]
Xi R, Ni Y, Wu W.
europepmc +1 more source
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem. [PDF]
Qian W +5 more
europepmc +1 more source
Joint Optimization of Trajectory-Resource Allocation and Deep Task Partial Offloading for MEC-Enabled Multi-UAV. [PDF]
Liu C, Wang Y, Mei H, Du S, Guo B.
europepmc +1 more source
A comparative analysis of crossovers in genetic algorithms for route optimization: case studies from Astana and Shymkent, Kazakhstan. [PDF]
Kazbek R +4 more
europepmc +1 more source
Astro-TSP: Traveling Salesman Problem Based Solutions for Scheduling Astronomical Based Observations
In the fields of Astronomy and Astrophysics, efficient utilization of observatory observation time is essential. This paper introduces the Astronomer's Traveling Salesman Problem (Astro-TSP), a scheduling problem for the process of creating an ...
Mitchell Humphries
core

