Network flow, transportation and scheduling. Theory and algorithms
From MaRDI portal
Publication:1843373
zbMath0281.90032MaRDI QIDQ1843373
Publication date: 1969
Published in: Mathematics in Science and Engineering (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Optimal distributed execution of join queries, Incorporating processor costs in optimizing the distributed execution of join queries, A very personal reminiscence on the problem of computational complexity, Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid, Computer-Aided Creation of Impossible Objects and Impossible Motions, Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations, A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm, Minimizing the response time of executing a join between fragmented relations in a distributed database system, Power packet transferability via symbol propagation matrix, A greedy algorithm for the optimal basis problem, A boolean theory of network flows and metrics and its applications to particle transmission and clustering, Genetic algorithms in constrained optimization, Some problems in discrete optimization, An efficient PQ-graph algorithm for solving the graph-realization problem, Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—, Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees, On some techniques useful for solution of transportation network problems, Minimal currents and relaxation of variational integrals on mappings of bounded variation, An algorithm for solving quadratic network flow problems, Minimal currents, geodesics, and relaxation of variational integrals on mappings of bounded variation, Hierarchical decomposition of symmetric discrete systems by matroid and group theories, Conjugacy relationship between M-convex and L-convex functions in continuous variables, “Rent-or-Buy” Scheduling and Cost Coloring Problems, Unique solvability and order of complexity of linear networks containing memorylessn-ports, Duality relationships between a class of graphs and linear programs, On dual solutions of the linear assignment problem, New algorithms for convex cost tension problem with application to computer vision, On the motion of substance in a channel and growth of random networks, Extension of M-convexity and L-convexity to polyhedral convex functions, A network flow procedure for project crashing with penalty nodes, Substitutes and complements in network flows viewed as discrete convexity, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values, Examples of max-flow and min-cut problems with duality gaps in continuous networks
