On bilevel minimum and bottleneck spanning tree problems

DOI10.1002/NET.21881MaRDI QIDQ5241426zbMATH OpenOpenAlexWikidataFDO

Authors 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

bilevel programmingbottleneck spanning tree problemcomputational complexityminimum spanning tree problemmixed integer programmingspanning tree problem

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
• The problem of the optimal biobjective spanning tree
• The computational complexity of bilevel assignment problems
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
• Exact solution approaches for bilevel assignment problems

Cited in

(5)

• On the bicriterion - minimal cost/minimal label - spanning tree problem
• On the complexity of the bilevel minimum spanning tree problem
• Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
• On the complexity of the bilevel shortest path problem
• The robust bilevel selection problem

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

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