scientific article
From MaRDI portal
zbMath0303.90014MaRDI QIDQ4058442
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing, Local optima topology for the \(k\)-coloring problem, Scaling algorithms for network problems, Unimodular functions, Solving matching problems with linear programming, Sequential and parallel algorithms for minimum flows., A decomposition algorithm for multi-terminal network flows, Multi-terminal maximum flows in node-capacitated networks, A generalization of the scaling max-flow algorithm, Exploiting locality in LT-RAM computations, Recent developments in maximum flow algorithms, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Boolean regression, An auction algorithm for the max-flow problem, New algorithms for the weighted maximum cut problem on graphs, On the efficiency of maximum-flow algorithms on networks with small integer capacities, Maximal closure on a graph with resource constraints, Topology optimisation of repairable flow networks for a maximum average availability, On strongly polynomial dual simplex algorithms for the maximum flow problem, A multifacility location problem on median spaces, Enhanced instance space analysis for the maximum flow problem, Simplifications and speedups of the pseudoflow algorithm, A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs, Scheduling unit-time jobs on processors with different capabilities, A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks, Strongly polynomial dual simplex methods for the maximum flow problem, TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration, A parametric maximum flow algorithm for bipartite graphs with applications, On stable flows and preflows, On implementing push-relabel method for the maximum flow problem, Pattern matching with wildcards and length constraints using maximum network flow, Algebraic flows in regular matroids, A fast maximum flow algorithm, On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, An \(O(EV\log^2V)\) algorithm for the maximal flow problem, The maximum flow problem of uncertain network, An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, On the theoretical efficiency of various network flow algorithms, The symbolic algorithms for maximum flow in networks, Optimal cocircuits in regular matroids and applications, Approximation algorithms for energy-efficient scheduling of parallel jobs, On the solution of discrete bottleneck problems, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, A competitive two-agent scheduling problem on parallel machines with release dates and preemption, Processor-efficient implementation of a maximum flow algorithm, Worst case behavior of the Dinic algorithm, Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs, A new approach for solving the network problems, Algorithms for flows with parametric capacities, A new Karzanov-type \(O(n^ 3)\) max-flow algorithm, Exact cuts in networks, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree, A good algorithm for lexicographically optimal flows in multi-terminal networks, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Inverse Shortest Path Models Based on Fundamental Cycle Bases, Parallel algorithms for the maximum flow problem with minimum lot sizes, Scheduling preemptive open shops to minimize total tardiness, A combinatorial algorithm for weighted stable sets in bipartite graphs, Upper bounds and exact algorithms for \(p\)-dispersion problems, Structural and algorithmic properties for parametric minimum cuts, Approximability issues for unconstrained and constrained maximization of half-product related functions, An \(O(IVI^3)\) algorithm for finding maximum flows in networks, Numerical investigations on the maximal flow algorithm of Karzanov, A parallel algorithm for finding a blocking flow in an acyclic network, A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, On module assignment in two-processor distributed systems, Computational investigations of maximum flow algorithms, Implementing Goldberg's max-flow-algorithm ? A computational investigation, An O(K.n**4) algorithm for finding the K best cuts in a network, A data structure for dynamic trees, Decomposition algorithms for locating minimal cuts in a network, Recent trends in combinatorial optimization, Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity, The \(\alpha\)-maximum flow model with uncertain capacities, A simple version of Karzanov's blocking flow algorithm, A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, An algorithmic study of the maximum flow problem: A comparative statistical analysis, Optimal sharing, The maximum flow problem: A max-preflow approach, Firing partial orders in a Petri net
