scientific article; zbMATH DE number 3302125

zbMath0189.24102MaRDI QIDQ5583694

No author found.

Publication date: 1967

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

topology

Related Items

Balancing problems in acyclic networks, Computing maximum mean cuts, A network-based model for transporting extremely hazardous materials, Dioïds and semirings: Links to fuzzy sets and other applications, The most critical path in a PERT network: A heuristic approach, Extremal eigenproblem for bivalent matrices, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Approximating a class of combinatorial problems with rational objective function, The cost-to-time ratio problem for large or infinite graphs, Minimum cost-reliability ratio path problem, Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues, The basic cyclic scheduling problem with linear precedence constraints, Paths with minimum range and ratio of arc lengths, On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns, Fractional 0-1 programming: applications and algorithms, A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems, The multi-weighted spanning tree problem, Fractional programming: Applications and algorithms, Vyacheslav Tanaev: contributions to scheduling and related areas, A survey of dynamic network flows, Weighted min cost flows, Numerical analysis of generalised max-plus eigenvalue problems., 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, Fractional programming, Detecting highly oscillatory signals by chirplet path pursuit, 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, Survey of polynomial transformations between NP-complete problems, Facets of the \(p\)-cycle polytope, A characterization of the minimum cycle mean in a digraph, Periodic schedules for linear precedence constraints, A note on weighted minimal cost flows, An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra., Status of periodic optimization of dynamical systems, \(\ell\)-parametric eigenproblem in max-algebra, Computing optimal scalings by parametric network algorithms, Bibliography in fractional programming, The maximum ratio clique problem