A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs

Solving combinatorial optimization (CO) on graphs is among the fundamental tasks for upper-stream applications in data mining, machine learning and operations research. Despite the inherent NP-hard challenge for CO, heuristics, branch-and-bound, learning-based solvers are developed to tackle CO prob...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2022-06
Hauptverfasser:	Lu, Han, Li, Zenan, Wang, Runzhong, Ren, Qibing, Junchi Yan, Yang, Xiaokang
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorial analysis Optimization Solvers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!