Feasibility in capacitated networks: The effect of individual arcs and nodes

DOI10.1007/BF02284628zbMath0891.68074OpenAlexW3021242995MaRDI QIDQ1380444

Saied Ghannadan, Stein W. Wallace

Publication date: 4 March 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02284628

zbMATH Keywords

feasibilitycapacitated networkGale-Hoffman inequalities

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Consistency, redundancy, and implied equalities in linear systems

Cites Work

• Unnamed Item
• A theorem on flows in networks
• The facets of the polyhedral set determined by the Gale-Hoffman inequalities
• Consistency, redundancy, and implied equalities in linear systems
• Preprocessing in Stochastic Programming: The Case of Linear Programs
• Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
• Preprocessing in Stochastic Programming: The Case of Capacitated Networks