A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game

DOI10.1016/j.endm.2016.03.041zbMath1351.90054MaRDI QIDQ325472

Mohammad Hasan, M. Dambrine

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.041

zbMATH Keywords

Stackelberg games; branch-and-cut-and-price; spanning trees

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

91A12: Cooperative games

90C05: Linear programming

90B10: Deterministic network models in operations research