How to compute least infeasible flows
type: Item
instance of: scholarly article
title: How to compute least infeasible flows
zbMATH Open document ID: 0889.90065
DOI: 10.1007/BF02614370
author: S. Thomas McCormick
published in: Mathematical Programming. Series A. Series B
publication date: 1997-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1091309
zbMATH Keywords: least infeasible flows
zbMATH Keywords: dual cut canceling min-cost flow network algorithms
MaRDI profile type: Publication
cites work: Diagnosing infeasibilities in network flow problems
cites work: Finding minimum-cost flows by double scaling
cites work: Q3056948
cites work: Note on Weintraub’s Minimum-Cost Circulation Algorithm
cites work: On a routing problem
cites work: Two strongly polynomial cut cancelling algorithms for minimum cost network flow
cites work: Canceling most helpful total cuts for minimum cost network flow
cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
cites work: Submodular functions and optimization
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
cites work: Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
cites work: Consistency, redundancy, and implied equalities in linear systems
cites work: The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
cites work: Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
cites work: Q3274170
cites work: A new saling algorithm for the maximum mean cut problem
cites work: Computing maximum mean cuts
cites work: Approximate binary search algorithms for mean cuts and cycles
cites work: Q4763405
cites work: Parametric flows, weighted means of cuts, and fractional combinatorial optimization
cites work: A Primal Algorithm to Solve Network Flow Problems with Convex Costs
cites work: Faster parametric shortest path and minimum‐balance algorithms
full work available at URL: https://doi.org/10.1007/bf02614370
OpenAlex ID: W1968878023
description: scientific article; zbMATH DE number 1091309