Inverse problem of minimum cuts
- 1 February 1998
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 47 (1) , 51-58
- https://doi.org/10.1007/bf01193836
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Inverse Matroid Intersection ProblemMathematical Methods of Operations Research, 1997
- Inverse maximum flow and minimum cut problemsOptimization, 1997
- Calculating some inverse linear programming problemsJournal of Computational and Applied Mathematics, 1996
- On the inverse problem of minimum spanning tree with partition constraintsMathematical Methods of Operations Research, 1996
- A network flow method for solving some inverse combinatorial optimization problemsOptimization, 1996
- A column generation method for inverse shortest path problemsMathematical Methods of Operations Research, 1995
- An inverse problem of the weighted shortest path problemJapan Journal of Industrial and Applied Mathematics, 1995
- On an instance of the inverse shortest paths problemMathematical Programming, 1992
- A Faster Strongly Polynomial Minimum Cost Flow AlgorithmPublished by Defense Technical Information Center (DTIC) ,1988
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985