A strongly polynomial algorithm for the inverse shortest arborescence problem
From MaRDI portal
(Redirected from Publication:1383373)
Recommendations
- A simple algorithm and min-max formula for the inverse arborescence problem
- Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance
- On an instance of the inverse shortest paths problem
- An inverse problem of the weighted shortest path problem
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
Cites work
Cited in
(12)- Inverse shortest path models based on fundamental cycle bases
- Inverse optimization problems with multiple weight functions
- Note on inverse problem with l_ objective function
- A simple algorithm and min-max formula for the inverse arborescence problem
- An inverse problem of the weighted shortest path problem
- A strongly polynomial time algorithm for the maximum supply rate problem on trees
- A strongly polynomial time algorithm for the maximum supply rate problem on trees
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
- Inverse problems of submodular functions on digraphs
- Some reverse location problems
- The base-matroid and inverse combinatorial optimization problems.
- scientific article; zbMATH DE number 1931135 (Why is no real title available?)
This page was built for publication: A strongly polynomial algorithm for the inverse shortest arborescence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383373)
