Home > Research > Publications & Outputs > Feasibility in uncapacitated networks
View graph of relations

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

Research output: Contribution to journalJournal articlepeer-review

Published
<mark>Journal publication date</mark>12/1996
<mark>Journal</mark>Annals of Operations Research
Issue number1
Volume64
Number of pages14
Pages (from-to)197-210
Publication StatusPublished
<mark>Original language</mark>English

Abstract

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.