Abstract
Camion proved that every real-valued matrix A can be transformed by pivoting operations and nonzero multiplications of columns into a nonnegative matrix. In this paper we describe a finite algorithm to make this transformation, based on the results of Camion. Our main result is that when A is a totally unimodular matrix this transformation can be made by a polynomial algorithm.
Preview
Unable to display preview. Download preview PDF.
References
P. Camion, “Modules unimodulaires”, Journal of Combinatorial Theory 4 (1968) 301–362.
W.H. Cunningham, “Separating cocircuits in binary matroids”, Linear Algebra and Its Applications 43 (1982) 69–86.
J. Edmonds, Seminaire à l’Université de Grenoble (Grenoble, France, June 1981).
M. Grötschel, L. Lovasz and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimisation”, Combinatorica 1 (1981) 169–197.
A. Mandel, “The topology of oriented matroids”, Ph.D. Thesis, University of Waterloo (Waterloo, 1982).
M. Raco, Thèse 3ème Cycle, l’Université de Grenoble (Grenoble, France, June 1983).
P.D. Seymour, “Decomposition of regular matroids”, Journal of Combinatorial Theory B28 (1980) 305–359.
W.T. Tutte, “Lecutres on matroids”, Journal of Research, National Bureau of Standards B69 (1965) 1–47.
D.J.A. Welsh, Matroid theory (Academic Press, New York, 1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Fonlupt, J., Raco, M. (1984). Orientation of matrices. In: Korte, B., Ritter, K. (eds) Mathematical Programming at Oberwolfach II. Mathematical Programming Studies, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121010
Download citation
DOI: https://doi.org/10.1007/BFb0121010
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00914-3
Online ISBN: 978-3-642-00915-0
eBook Packages: Springer Book Archive