A Cardinality-Disaggregated Extended Formulation and Cutset Inequalities for the Steiner Tree Problem

Published: 2026/06/10

Md Shahrukh Anjum

(Mixed) Integer Linear Programming, Branch and Cut Algorithms, Polyhedra branch-and-cut, cardinality, cutset inequalities, disaggregation, extended formulation, steiner tree problem, valid inequalities Short URL: https://optimization-online.org/?p=35161

Article