A mixed-integer linear programming problem which is efficiently solvable
- 31 March 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (1) , 114-128
- https://doi.org/10.1016/0196-6774(88)90008-9
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Priority queues with update and finding minimum spanning treesInformation Processing Letters, 1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- An algorithm for finding shortest routes from all source nodes to a given destination in general networksQuarterly of Applied Mathematics, 1970
- A note on two problems in connexion with graphsNumerische Mathematik, 1959