A new approach to the maximum-flow problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Executability of scenarios in Petri nets
- An efficient minimum and maximum global snapshot algorithm
- Minimization of locally defined submodular functions by optimal soft arc consistency
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Processor-efficient implementation of a maximum flow algorithm
- Parallel cardinality stacks and an application
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
- A new Karzanov-type O(n^ 3) max-flow algorithm
- New algorithms for the intersection problem of submodular systems
- Extracting maximal information about sets of minimum cuts
- A heuristic for blocking flow algorithms
- Computational investigations of maximum flow algorithms
- Diagnosing infeasibilities in network flow problems
- Symmetric flows and broadcasting in hypercubes
- A new saling algorithm for the maximum mean cut problem
- A faster parametric minimum-cut algorithm
- On the complexity of preflow-push algorithms for maximum-flow problems
- Approximate decision algorithms for point set congruence
- Computing maximum mean cuts
- A distance constrained p-facility location problem on the real line
- Optimal channel allocation for several types of cellular radio networks
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- A branch-and-cut algorithm for the equicut problem
- Strongly polynomial dual simplex methods for the maximum flow problem
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Minimum cut problem using bases of extended polymatroids
- An incremental algorithm for the maximum flow problem
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Improving graph partitions using submodular functions.
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
- On one maximum multiflow problem and related metrics
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- A note on optimal covering augmentation for graphic polymatroids.
- Structural relatedness via flow networks in protein sequence space
- Optimally solving the joint order batching and picker routing problem
- Inefficiencies in network models: a graph-theoretic perspective
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
- A note on balanced flows in equality networks
- Greedy oriented flows
- The separation problem of rounded capacity inequalities: some polynomial cases
- The traveling purchaser problem and its variants
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Combined optimisation of an open-pit mine outline and the transition depth to underground mining
- A computational study of the capacity scaling algorithm for the maximum flow problem
- Greedy splitting algorithms for approximating multiway partition problems
- Computing minimum multiway cuts in hypergraphs
- Implementing an efficient minimum capacity cut algorithm
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Polyhedral structure of submodular and posi-modular systems
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
- Sequential and parallel algorithms for minimum flows.
- Strength of a graph and packing of trees and branchings
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- An auction algorithm for the max-flow problem
- An efficient cost scaling algorithm for the assignment problem
- On the complexity of nonnegative-matrix scaling
- Strongly polynomial simplex algorithm for bipartite vertex packing
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Simple push-relabel algorithms for matroids and submodular flows
- Minimizing energies with hierarchical costs
- A golden ratio parameterized algorithm for cluster editing
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- Faster algorithms for stable allocation problems
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- 3D reconstruction with depth prior using graph-cut
- Reconstruction, optimization, and design of heterogeneous materials and media: basic principles, computational algorithms, and applications
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Using the graph-cut method to segment the mineralization area in the gejiu region of Yunnan province, China
- Distance metric learning for graph structured data
- On some algorithmic aspects of hypergraphic matroids
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
- An algorithm for improved delay-scaling in input-queued switches
- The assignment problem revisited
- HNCcorr: combinatorial optimization for neuron identification
- Enhanced instance space analysis for the maximum flow problem
- Co-density and fractional edge cover packing
- Fair-by-design matching
- Topologically trivial closed walks in directed surface graphs
- Stronger MIP formulations for the Steiner forest problem
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
- The distance constrained multiple vehicle traveling purchaser problem
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Segmentation of choroidal boundary in enhanced depth imaging octs using a multiresolution texture based modeling in graph cuts
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- Path planning for unmanned vehicles with localization constraints
- On chromatic number and minimum cut
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)
