Bounds for 3-matroid intersection problems
- 31 January 1975
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 3 (3) , 81-83
- https://doi.org/10.1016/0020-0190(75)90021-6
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Technical Note—Bounds for the Travelling-Salesman ProblemOperations Research, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971