On bilevel minimum and bottleneck spanning tree problems

DOI10.1002/net.21881zbMath1423.90047OpenAlexW2928408202WikidataQ128124741 ScholiaQ128124741MaRDI QIDQ5241426

Xueyu Shi, Bo Zeng, Oleg A. Prokopyev

Publication date: 31 October 2019

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21881

zbMATH Keywords

computational complexitymixed integer programmingminimum spanning tree problembilevel programmingspanning tree problembottleneck spanning tree problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18) Linear programming (90C05)

Related Items (2)

On the complexity of the bilevel minimum spanning tree problem ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds

This page was built for publication: On bilevel minimum and bottleneck spanning tree problems