A new approach to the maximum-flow problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
- Cost minimization in wireless networks with a bounded and unbounded number of interfaces
- An incremental algorithm for the maximum flow problem
- Path planning for unmanned vehicles with localization constraints
- Hypergraphic submodular function minimization
- A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
- Dynamic evolution of economically preferred facilities
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Playing with the Maximum-Flow Problem
- Fair-by-design matching
- Complexity and algorithms for nonlinear optimization problems
- Multicommodity network flows: A survey. II: Solution methods
- Mesh quality agglomeration algorithm for the virtual element method applied to discrete fracture networks
- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees
- Structural and algorithmic properties for parametric minimum cuts
- Practical minimum cut algorithms
- HNCcorr: combinatorial optimization for neuron identification
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
- Inverse shortest path models based on fundamental cycle bases
- Learning-augmented maximum flow
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
- Minimum cut problem using bases of extended polymatroids
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- Constructing the minimization diagram of a two-parameter problem
- Edge-Cuts of Optimal Average Weights
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Bisection approach for pixel labelling problem
- Strongly polynomial simplex algorithm for bipartite vertex packing
- More efficient parallel flow algorithms
- Throughput analysis in wireless networks with multiple users and multiple channels
- Tight localizations of feedback sets
- Greedy splitting algorithms for approximating multiway partition problems
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- A Fast and Simple Algorithm for the Maximum Flow Problem
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
- A note on optimal covering augmentation for graphic polymatroids.
- On implementing push-relabel method for the maximum flow problem
- Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures
- ReLU neural networks of polynomial size for exact maximum flow computation
- Submodular function minimization
- A note on balanced flows in equality networks
- Deciding Simulations on Probabilistic Automata
- Weighted maximum-clique transversal sets of graphs
- Simplifying maximum flow computations: the effect of shrinking and good initial flows
- Inefficiencies in network models: a graph-theoretic perspective
- Fast FPT algorithms for Grundy number on dense graphs
- Spanner approximations in practice
- Optimal cuts in graphs and statistical mechanics
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Topologically trivial closed walks in directed surface graphs
- Stackelberg bipartite vertex cover and the preflow algorithm
- The axiomatization of override and update
- The vertex \(k\)-cut problem
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
- Maximum bipartite flow in networks with adaptive channel width
- A Randomized Maximum-Flow Algorithm
- Maximum network flow with floating point arithmetic.
- Crown reductions for the minimum weighted vertex cover problem
- On one maximum multiflow problem and related metrics
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Maximum flow in hybrid network with intermediate storage
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Improving graph partitions using submodular functions.
- Densities, matchings, and fractional edge-colorings
- Aggregation of monotone reciprocal relations with application to group decision making
- Domain decomposition methods with graph cuts algorithms for total variation minimization
- A fast maximum flow algorithm
- An exact combinatorial algorithm for minimum graph bisection
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- A theoretical and computational study of green vehicle routing problems
- Minimum-cost flow algorithms: an experimental evaluation
- Simplifications and speedups of the pseudoflow algorithm
- Stronger MIP formulations for the Steiner forest problem
- A faster algorithm for computing the principal sequence of partitions of a graph
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- On chromatic number and minimum cut
- Improved balanced flow computation using parametric flow
- Faster and more dynamic maximum flow by incremental breadth-first search
- On some algorithmic aspects of hypergraphic matroids
- Minimizing energies with hierarchical costs
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- A parallel blocking flow algorithm for acyclic networks
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- The reduction and fusion of fuzzy covering systems based on the evidence theory
- A heuristic for blocking flow algorithms
- Survivability in hierarchical telecommunications networks
- A new approach for computing a most positive cut using the minimum flow algorithms
- Deadline-aware network coding for video on demand service over P2P networks
- A branch-and-cut algorithm for the equicut problem
- A new strategy for the undirected two-commodity maximum flow problem
- Just-in-time scheduling with equal-size jobs
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- An algorithm for improved delay-scaling in input-queued switches
- Structural relatedness via flow networks in protein sequence space
This page was built for publication: A new approach to the maximum-flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812009)
