AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

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

Wenzheng Pan, Hao Xiong, Jiale Ma, Wentao Zhao, Yang Li, Junchi Yan

ICLR 2025 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes UniCO, which reduces diverse combinatorial optimization problems to a general matrix-encoded TSP form so a single neural solver can handle them.

Problem

Neural solvers for combinatorial optimization are usually tailored to specific problem types (TSP, CVRP, SAT, etc.), and it is unclear how to achieve universal problem representation and learning within one framework.

Approach

Reduce a set of CO problems into a general TSP form encoded by a distance matrix, so that one unified neural solver can learn across problem types instead of per-problem architectures.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy