Inverse Matroid Intersection Problem
- 1 June 1997
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 45 (2) , 235-243
- https://doi.org/10.1007/bf01193863
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An algorithm for inverse minimum spanning tree problemOptimization Methods and Software, 1997
- 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 Algorithm to Solve Combinatorial Linear ProgramsOperations Research, 1986
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985
- A weighted matroid intersection algorithmJournal of Algorithms, 1981