A Fast Parametric Maximum Flow Algorithm and Applications
From MaRDI portal
Publication:4729349
Recommendations
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Parametric flows in static networks
- Algorithms for flows with parametric capacities
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- A note on the parametric maximum flow problem and some related reoptimization issues
Cited in
(only showing first 100 items - show all)- Optimal location with equitable loads
- A parametric maximum flow algorithm for bipartite graphs with applications
- Forests, frames, and games: Algorithms for matroid sums and applications
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Transitions in geometric minimum spanning trees
- Generalization of a theorem on the parametric maximum flow problem
- Extracting maximal information about sets of minimum cuts
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Diagnosing infeasibilities in network flow problems
- Minimizing a submodular function arising from a concave function
- A faster parametric minimum-cut algorithm
- Algorithms and complexity analysis for some flow problems
- A faster algorithm for computing the strength of a network
- Computing maximum mean cuts
- Parametric max flow problems in a class of networks with series-parallel structure
- Dynamic expression trees
- A parametric approach for maximum flow problems with an additional reverse convex constraint
- Maximal closure on a graph with resource constraints
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- How to compute least infeasible flows
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Improving graph partitions using submodular functions.
- 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.
- Complexity of finding dense subgraphs
- A note on balanced flows in equality networks
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Towards equitable distribution via proportional equity constraints
- A new upper bound for the 0-1 quadratic knapsack problem
- Parametric min-cuts analysis in a network.
- Computing the binding number of a graph
- On the supermodular knapsack problem
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Strength of a graph and packing of trees and branchings
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- Optimization of computations
- Minimum cuts in parametric networks
- Integral packing of trees and branchings
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Equivalence of convex minimization problems over base polytopes
- Branch-and-mincut: global optimization for image segmentation with high-level priors
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- In search of the densest subgraph
- An approximation algorithm for a general class of multi-parametric optimization problems
- Computing the \(k\) densest subgraphs of a graph
- On some algorithmic aspects of hypergraphic matroids
- An approximation algorithm for a general class of parametric optimization problems
- HNCcorr: combinatorial optimization for neuron identification
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Estimating piecewise monotone signals
- Fair-by-design matching
- Polynomial-time algorithms for submodular Laplacian systems
- Computer science and decision theory
- An FPTAS for the knapsack problem with parametric weights
- Submodular optimization views on the random assignment problem
- Parametric power supply networks
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- An FPTAS for the parametric knapsack problem
- Multicommodity flows over time: Efficient algorithms and complexity
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- Preemptive benchmarking problem: An approach for official statistics in small areas
- Image restoration with discrete constrained total variation. I: Fast and exact optimization
- Exact algorithms for problems related to the densest \(k\)-set problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Polynomiality of sparsest cuts with fixed number of sources
- A note on the parametric maximum flow problem and some related reoptimization issues
- Complexity and algorithms for nonlinear optimization problems
- The complexity of detecting fixed-density clusters
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- A survey on models and algorithms for discrete evacuation planning network problems
- Ordered optimal solutions and parametric minimum cut problems
- Network reinforcement
- Finding dense subgraphs with maximum weighted triangle density
- Complexity of source-sink monotone 2-parameter min cut
- Stackelberg bipartite vertex cover and the preflow algorithm
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Universally maximum flow with piecewise-constant capacities
- Total Variation in Imaging
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Summary and semi-average similarity criteria for individual clusters
- Improved balanced flow computation using parametric flow
- Optimization of an SMD placement machine and flows in parametric networks
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- On the complexity of hub labeling (extended abstract)
- Theory of principal partitions revisited
- Graphic submodular function minimization: a graphic approach and applications
- A fast parametric assignment algorithm with applications in max-algebra
- High-confidence estimation of small s-t reliabilities in directed acyclic networks
- Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry
- scientific article; zbMATH DE number 3876893 (Why is no real title available?)
- A note on the paper “characterization of all optimal solutions and parametric maximal flows in networks” of G. Ruhe (optimization 16 (1985) 1, 51-61)
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Faster and more dynamic maximum flow by incremental breadth-first search
- On the implementation of combinatorial algorithms for the linear exchange market
- Algorithms for the densest subgraph with at least \(k\) vertices and with a specified subset
This page was built for publication: A Fast Parametric Maximum Flow Algorithm and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729349)
