A simple algorithm and min-max formula for the inverse arborescence problem
From MaRDI portal
Publication:2661220
DOI10.1016/j.dam.2021.02.027zbMath1462.90105OpenAlexW3134073636MaRDI QIDQ2661220
Publication date: 1 April 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.027
Related Items
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra ⋮ Inverse optimization problems with multiple weight functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strongly polynomial minimum cost circulation algorithm
- On an instance of the inverse shortest paths problem
- Increasing the rooted connectivity of a digraph by one
- Inverse matroid intersection problem
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse problems of matroid intersection
- Matroid Intersection
- Packing rooted directed cuts in a weighted directed graph
- Optimum branchings