Canceling most helpful total cuts for minimum cost network flow

DOI10.1002/NET.3230230106zbMATH Open0781.90034OpenAlexW1967030975MaRDI QIDQ5285477FDOQ5285477

Authors: Thomas R. Ervolina, S. Thomas McCormick 

Publication date: 29 June 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230106

Recommendations

• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• scientific article; zbMATH DE number 1263281
• Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets
• A solution to the inverse minimum cut problem in dynamic network flows
• A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
• Minimum cost multiflows in undirected networks
• Minimum cuts in parametric networks
• A new approach for computing a most positive cut using the minimum flow algorithms
• A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem

zbMATH Keywords

polynomial algorithmminimum cost network flowmost helpful total cut cancelling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
• A new approach for computing a most positive cut using the minimum flow algorithms
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
• The minimal average cost flow problem
• How to compute least infeasible flows
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• Title not available (Why is that?)
• Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow

This page was built for publication: Canceling most helpful total cuts for minimum cost network flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285477)