The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
From MaRDI portal
Publication:3392224
DOI10.1287/opre.1080.0524zbMath1167.90394OpenAlexW2147965279MaRDI QIDQ3392224
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/67e15c4b288590f206b55156affd97f17355915d
Related Items (30)
A new branch-and-cut approach for the generalized regenerator location problem ⋮ Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm ⋮ Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search ⋮ Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ HNCcorr: combinatorial optimization for neuron identification ⋮ A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem ⋮ Simplifications and speedups of the pseudoflow algorithm ⋮ A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks ⋮ A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ Applications and efficient algorithms for integer programming problems on monotone constraints ⋮ An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems ⋮ An efficient method for optimizing nested open pits with operational bottom space ⋮ Optimization of open-pit mine design and production planning with an improved floating cone algorithm ⋮ Dynamic reversible lane optimization in autonomous driving environments: balancing efficiency and safety ⋮ A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems ⋮ Nuclear threat detection with mobile distributed sensor networks ⋮ Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling ⋮ Integer linear programming models for topology optimization in sheet metal design ⋮ A comparative study of the leading machine learning techniques and two new optimization algorithms ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms ⋮ Combined optimisation of an open-pit mine outline and the transition depth to underground mining ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ A new model for automated pushback selection ⋮ Evaluating performance of image segmentation criteria and techniques ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
This page was built for publication: The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
