For the minimum-cost network-flow problem, this is a matrix in which the rows i correspond to the nodes and the columns j correspond to the arcs. For an arc (i, j), with its flow directed from i to j, the entry in matrix location (i, j)is a + 1 and the entry in location (j, i)is a − 1. All other entries are zero. Thus, every column has only two nonzero entries. Such matrices are unimodular. Minimum-cost network-flow problem; Multicommodity network flows; Network optimization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Node-arc incidence matrix. In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_674
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_674
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive