| Article ID: | iaor19971506 |
| Country: | Netherlands |
| Volume: | 64 |
| Issue: | 1 |
| Start Page Number: | 197 |
| End Page Number: | 210 |
| Publication Date: | Jun 1996 |
| Journal: | Annals of Operations Research |
| Authors: | Wallace Stein W., Ghannadan Saied |
| Keywords: | programming: linear |
The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in an uncapacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.