Improved Algorithms for Bipartite Network Flow
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(53)- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- Geometric quadrisection in linear time, with application to VLSI placement
- A fast bipartite network flow algorithm for selective assembly
- A technique for speeding up the solution of the Lagrangean dual
- Network flow and 2-satisfiability
- A fast algorithm for the minimax flow problem with 0/1 weights
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
- A note on optimal covering augmentation for graphic polymatroids.
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Restricted assignment scheduling with resource constraints
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Two level hierarchical time minimizing transportation problem
- A strongly polynomial algorithm for the transportation problem
- An efficient cost scaling algorithm for the assignment problem
- An adaptive time slot assignment algorithm for variable bandwidth switching systems
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- The partition bargaining problem
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Level of repair analysis and minimum cost homomorphisms of graphs
- Max-min sum minimization transportation problem
- Network reinforcement
- A space-efficient simulation algorithm on probabilistic automata
- FIFO preflow algorithm for maximum flow in semi-bipartite networks
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- The cost scaling algorithm for bipartite networks
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- Fast Algorithms for Bipartite Network Flow
- scientific article; zbMATH DE number 4104675 (Why is no real title available?)
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Wave algorithm for maximum flow in semi-bipartite networks
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling
- The maximum flows in bipartite dynamic networks. The static approach
- Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n2/m)/log n) bound for the nonbipartite cardinality matching problem
- Geometric algorithms for the minimum cost assignment problem
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- Maximum flows in bipartite dynamic networks
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Wave algorithm for maximum flow in bipartite networks
- Solving maximum flow problems on real-world bipartite graphs
- Balancing Applied to Maximum Network Flow Problems
- Power balance and apportionment algorithms for the United States Congress
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- More efficient parallel flow algorithms
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Structural and algorithmic properties for parametric minimum cuts
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- The subset assignment problem for data placement in caches
- Approximability issues for unconstrained and constrained maximization of half-product related functions
- Efficient algorithms for robustness in resource allocation and scheduling problems
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Dynamic evolution of economically preferred facilities
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
This page was built for publication: Improved Algorithms for Bipartite Network Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312415)
