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

DOI10.1007/BF02187646zbMath0854.90062MaRDI QIDQ1918428

Stein W. Wallace, Saied Ghannadan

Publication date: 31 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

framecutfeasibilityfacetGale-Hoffman inequalitiesindividual arcs and nodespolar matrixuncapacitated network

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items

Consistency, redundancy, and implied equalities in linear systems

Cites Work

• Unnamed Item
• A theorem on flows in networks
• Partitioning procedures for solving mixed-variables programming problems
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming