Publication:5583694
From MaRDI portal
zbMath0189.24102MaRDI QIDQ5583694
No author found.
Publication date: 1967
Related Items
Fractional programming, Facets of the \(p\)-cycle polytope, A survey of dynamic network flows, The cost-to-time ratio problem for large or infinite graphs, Minimum cost-reliability ratio path problem, On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns, Fractional programming: Applications and algorithms, Weighted min cost flows, 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, A characterization of the minimum cycle mean in a digraph, 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, Numerical analysis of generalised max-plus eigenvalue problems., An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra., Extremal eigenproblem for bivalent matrices, The basic cyclic scheduling problem with linear precedence constraints, A network-based model for transporting extremely hazardous materials, Status of periodic optimization of dynamical systems, \(\ell\)-parametric eigenproblem in max-algebra, Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues, Computing optimal scalings by parametric network algorithms, A note on weighted minimal cost flows, Bibliography in fractional programming
