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

DOI10.1016/J.ENDM.2016.03.041zbMath1351.90054OpenAlexW2408198031MaRDI 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 gamesbranch-and-cut-and-pricespanning trees

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Cooperative games (91A12) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (3)

Computational comparisons of different formulations for the Stackelberg minimum spanning tree game ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ A survey on mixed-integer programming techniques in bilevel optimization

Cites Work

• The Stackelberg minimum spanning tree game
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• Bilevel programming and price setting problems

This page was built for publication: A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game