A practical algorithm for the Menger-type generalization of the independent assignment problem
- 1 January 1978
- book chapter
- Published by Springer Nature
- p. 88-105
- https://doi.org/10.1007/bfb0121196
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- AN ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGEJournal of the Operations Research Society of Japan, 1977
- A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEMJournal of the Operations Research Society of Japan, 1977
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"Journal of the Operations Research Society of Japan, 1976
- Rado's theorem for polymatroidsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Menger's Theorem and MatroidsJournal of the London Mathematical Society, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Kruskal's theorem for matroidsMathematical Proceedings of the Cambridge Philosophical Society, 1968
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956