scientific article
From MaRDI portal
Publication:4010349
zbMath0749.90027MaRDI QIDQ4010349
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Approximate decision algorithms for point set congruence, Most and least uniform spanning trees, Algorithms for approximate graph matching, On finding most uniform spanning trees, Fuzzy intersection graphs, A fast algorithm for the minimax flow problem with 0/1 weights, Optimal channel allocation for several types of cellular radio networks, A simplified construction of nonlinear Davenport-Schinzel sequences, A reoptimization algorithm for the shortest path problem with time windows, Lower bounds for planar orthogonal drawings of graphs, Discrete warehouse problem, An efficient algorithm for the all pairs suffix-prefix problem, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, Generalized Davenport-Schinzel sequences with linear upper bound, Range-restricted mergeable priority queues, The lexicographically first topological order problem is NLOG-complete, On an optimization problem with nested constraints, Shortest path algorithms for nearly acyclic directed graphs, ``Global graph problems tend to be intractable, Maintaining a topological order under edge insertions, A lower bound to the complexity of Euclidean and rectilinear matching algorithms
