Optimal cost augmentation and interdiction problem for the minimum spanning tree

DOI10.1016/J.COR.2026.107435MaRDI QIDQ7240137zbMATH OpenFDO

Authors Luis A. Salazar-Zendeja, Diego Cattaruzza, Martine Labbé, F. Semet

Publication date 11 May 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2026.107435

zbMATH Keywords

deterministic network modelsinterdiction problemsminimum spanning tree interdictionmixed-integer problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A linear programming approach to increasing the weight of all minimum spanning trees
• A survey of network interdiction models and algorithms
• A survey on mixed-integer programming techniques in bilevel optimization
• Bilevel programming and applications
• Bilevel programming: a survey
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
• Efficient algorithms for finding the most vital edge of a minimum spanning tree
• Efficient determination of the k most vital edges for the minimum spanning tree problem
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• Finding the k most vital edges with respect to minimum spanning tree
• Finding the k most vital edges in the minimum spanning tree problem
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• Foundations of bilevel programming
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• Increasing the Weight of Minimum Spanning Trees
• Integer Programming Formulations for Minimum Spanning Tree Interdiction
• Shortest path network interdiction with asymmetric information
• Shortest-path network interdiction
• The first example of a recursive function which is not primitive recursive
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• The most vital edges in the minimum spanning tree problem
• Using separation algorithms to generate mixed integer model reformulations

This page was built for publication: Optimal cost augmentation and interdiction problem for the minimum spanning tree

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