Crashing a maximum-weight complementary basis
- 1 February 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 54 (1-3) , 281-294
- https://doi.org/10.1007/bf01586055
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Intersection of Two Matroids: (Condensed) Border Graphs and RankingSIAM Journal on Discrete Mathematics, 1989
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphsMathematical Programming, 1988
- Two algorithms for weighted matroid intersectionMathematical Programming, 1986
- Maintaining Lu Factors of a General Sparse Matrix.Published by Defense Technical Information Center (DTIC) ,1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Applications of Matroid TheoryPublished by Springer Nature ,1983
- A weighted matroid intersection algorithmJournal of Algorithms, 1981
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"Journal of the Operations Research Society of Japan, 1976