A strongly polynomial algorithm for the inverse shortest arborescence problem
From MaRDI portal
Publication:1383373
DOI10.1016/S0166-218X(97)86750-9zbMATH Open0897.90188OpenAlexW1570195365MaRDI QIDQ1383373FDOQ1383373
Authors: Zhenhong Liu, Zhiquan Hu 
Publication date: 5 October 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
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
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
Cited In (12)
- Inverse shortest path models based on fundamental cycle bases
- Inverse optimization problems with multiple weight functions
- A simple algorithm and min-max formula for the inverse arborescence problem
- Note on inverse problem with \(l_\infty\) objective function
- 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.
- Title not available (Why is that?)
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)
