Publication:5583694
From MaRDI portal
zbMath0189.24102MaRDI QIDQ5583694
No author found.
Publication date: 1967
Related Items
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems, An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix, A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network, Algorithms for the minimum cost circulation problem based on maximizing the mean improvement, Balancing problems in acyclic networks, Computing maximum mean cuts, The most critical path in a PERT network: A heuristic approach, Paths with minimum range and ratio of arc lengths, Extremal eigenproblem for bivalent matrices, The basic cyclic scheduling problem with linear precedence constraints, A network-based model for transporting extremely hazardous materials