AI Paper Atlas

Research map / Graph learning / Graph self-supervised learning

OPTFM: A Scalable Multi-View Graph Transformer for Hierarchical Pre-Training in Combinatorial Optimization

Hao Yuan, Wenli Ouyang, Changwen Zhang, Congrui Li, Yong Sun

NeurIPS 2025 · Graph learning › Graph self-supervised learning · approach: Multi-view graph clustering · 0 citations (OpenAlex)

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 OPTFM, a scalable multi-view graph transformer pre-trained hierarchically as a foundation model for combinatorial optimization problems formulated as graphs.

Problem

Foundation models have been successful in vision and NLP but remain underexplored for combinatorial optimization, where problems are NP-hard graphs with diverse structures and varying distributions.

Approach

A graph foundation model with a scalable multi-view graph transformer and hierarchical pre-training tailored to diverse combinatorial optimization graph structures; full method details are not available beyond the abstract.

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