scientific article; zbMATH DE number 3475221

Cited in

(88)

Scaling algorithms for network problems
Unimodular functions
A decomposition algorithm for multi-terminal network flows
Multi-terminal maximum flows in node-capacitated networks
On the efficiency of maximum-flow algorithms on networks with small integer capacities
Scheduling unit-time jobs on processors with different capabilities
A parametric maximum flow algorithm for bipartite graphs with applications
Algebraic flows in regular matroids
An \(O(EV\log^2V)\) algorithm for the maximal flow problem
An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
On the theoretical efficiency of various network flow algorithms
Optimal cocircuits in regular matroids and applications
On the solution of discrete bottleneck problems
Processor-efficient implementation of a maximum flow algorithm
Worst case behavior of the Dinic algorithm
A new Karzanov-type O(n^ 3) max-flow algorithm
An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
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
Computational investigations of maximum flow algorithms
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
Local optima topology for the \(k\)-coloring problem
Maximal closure on a graph with resource constraints
On strongly polynomial dual simplex algorithms for the maximum flow problem
Strongly polynomial dual simplex methods for the maximum flow problem
An algorithmic study of the maximum flow problem: A comparative statistical analysis
A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
An O(K.n**4) algorithm for finding the K best cuts in a network
A data structure for dynamic trees
Sequential and parallel algorithms for minimum flows.
A generalization of the scaling max-flow algorithm
Boolean regression
An auction algorithm for the max-flow problem
New algorithms for the weighted maximum cut problem on graphs
A multifacility location problem on median spaces
Firing partial orders in a Petri net
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
Enhanced instance space analysis for the maximum flow problem
Approximation algorithms for energy-efficient scheduling of parallel jobs
Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity
The -maximum flow model with uncertain capacities
The symbolic algorithms for maximum flow in networks
A combinatorial algorithm for weighted stable sets in bipartite graphs
Upper bounds and exact algorithms for \(p\)-dispersion problems
A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
Topology optimisation of repairable flow networks for a maximum average availability
Solving matching problems with linear programming
Algorithms for flows with parametric capacities
Exact cuts in networks
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
Decomposition algorithms for locating minimal cuts in a network
Optimal sharing
A good algorithm for lexicographically optimal flows in multi-terminal networks
Implementing Goldberg's max-flow-algorithm ? A computational investigation
A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs
A competitive two-agent scheduling problem on parallel machines with release dates and preemption
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
A new approach for solving the network problems
Exploiting locality in LT-RAM computations
Recent developments in maximum flow algorithms
TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
On implementing push-relabel method for the maximum flow problem
Machine speed scaling by adapting methods for convex optimization with submodular constraints
Inverse shortest path models based on fundamental cycle bases
Parallel algorithms for the maximum flow problem with minimum lot sizes
Simplifications and speedups of the pseudoflow algorithm
On stable flows and preflows
A fast maximum flow algorithm
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
On the impact of initialisation strategies on maximum flow algorithm performance
The quadratic knapsack problem
Scheduling electric vehicle regular charging tasks: a review of deterministic models
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
Scalable high-quality hypergraph partitioning
Scheduling preemptive open shops to minimize total tardiness
Structural and algorithmic properties for parametric minimum cuts
Approximability issues for unconstrained and constrained maximization of half-product related functions
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
On module assignment in two-processor distributed systems
Recent trends in combinatorial optimization
A simple version of Karzanov's blocking flow algorithm
The maximum flow problem: A max-preflow approach
Pattern matching with wildcards and length constraints using maximum network flow
On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems
The maximum flow problem of uncertain network

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4058442)