Learning to prune instances of Steiner tree problem in graphs

DOI10.48786/INOC.2024.08MaRDI QIDQ6907215zbMATH OpenFDO

Authors Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani

Publication date 3 November 2025

Full work available at URL https://doi.org/10.48786/INOC.2024.08

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(1)

• A scalable learning approach for efficient computation of independent set and cover variants

This page was built for publication: Learning to prune instances of Steiner tree problem in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907215)