Generalized max flows and augmenting paths

DOI10.1007/3-540-59408-6_51zbMath1498.90239OpenAlexW1581962249MaRDI QIDQ5101415

David B. Hartvigsen

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_51

zbMATH Keywords

generalized max flow problemminimum length augmenting paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• An operator theory of parametric programming for the transportation problem-I
• Maximal Flow Through a Network
• Scheduling transmissions in a network
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Optimal attack and reinforcement of a network
• A new approach to the maximum-flow problem
• Using separation algorithms in fixed dimension
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A Fast Parametric Maximum Flow Algorithm and Applications