IEEE

Reinforcement Learning for Solving Colored Traveling Salesman Problems: An Entropy-Insensitive Attention Approach

Abstract: The utilization of neural network models for solving combinatorial optimization problems (COPs) has gained significant attention in recent years and has demonstrated encouraging outcomes in ...
GitHub

UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP

This is the official implementation of our ICLR 2025 paper "UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP". Fig 1. The 3-step workflow of the UniCO ...
IEEE

A Method of the Traveling Salesman Problem Based On Q-Learning Reinforcement Learning and Local Dynamic Programming

Abstract: This study explores optimizing the Traveling Salesman Problem (TSP) using Q-Learning reinforcement learning. The proposed method builds a Q-table to learn the optimal path and employs ...
GitHub

Dynamic 2D Gaussians: Geometrically Accurate Radiance Fields for Dynamic Objects

1 School of Electronic Information and Communications, Huazhong University of Science and Technology 2 School of Computer Science & Technology, Huazhong University of Science and Technology ...
The Hacker News

Blind Eagle's Five Clusters Target Colombia Using RATs, Phishing Lures, and Dynamic DNS Infra

Cybersecurity researchers have discovered five distinct activity clusters linked to a persistent threat actor known as Blind Eagle between May 2024 and July 2025. These attacks, observed by Recorded ...