{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T03:10:27Z","timestamp":1719803427510},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0372-8","type":"journal-article","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T02:40:45Z","timestamp":1276310445000},"page":"349-381","source":"Crossref","is-referenced-by-count":3,"title":["Recognizing binet matrices"],"prefix":"10.1007","volume":"124","author":[{"given":"Antoine","family":"Musitelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"issue":"4","key":"372_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/net.20108","volume":"47","author":"G. Appa","year":"2006","unstructured":"Appa G., Kotnyek B.: A bidirected generalization of network matrices. Networks 47(4), 185\u2013198 (2006)","journal-title":"Networks"},{"key":"372_CR2","first-page":"827","volume":"8","author":"L. Auslander","year":"1959","unstructured":"Auslander L., Trent H.M.: Incidence matrices and linear graphs. J. Math. Mech. 8, 827\u2013835 (1959)","journal-title":"J. Math. Mech."},{"key":"372_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","volume":"90","author":"D. Bienstock","year":"1991","unstructured":"Bienstock D.: On complexity of testing for odd holes and induced odd paths. Discrete Math. 90, 85\u201392 (1991)","journal-title":"Discrete Math."},{"issue":"1","key":"372_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0095-8956(77)90047-8","volume":"22","author":"R.E. Bixby","year":"1977","unstructured":"Bixby R.E.: Kuratowski\u2019s and Wagner\u2019s theorems for matroids. J. Comb. Theory Ser. B 22(1), 31\u201353 (1977)","journal-title":"J. Comb. Theory Ser. B"},{"key":"372_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","volume":"5","author":"R.E. Bixby","year":"1980","unstructured":"Bixby R.E., Cunningham W.H.: Converting linear programs to network problems. Math. Oper. Res. 5, 321\u2013357 (1980)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"372_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","volume":"13","author":"R.E. Bixby","year":"1988","unstructured":"Bixby R.E., Wagner D.K.: An almost linear-time algorithm for graph realization. Math. Oper. Res. 13(1), 99\u2013123 (1988)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"372_CR7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20117","volume":"48","author":"E.D. Bolker","year":"2006","unstructured":"Bolker E.D., Zaslavsky T.: A simple algorithm that proves half-integrality of bidirected network programming. Networks 48(1), 36\u201338 (2006)","journal-title":"Networks"},{"key":"372_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0021-9800(68)80061-4","volume":"4","author":"P. Camion","year":"1968","unstructured":"Camion P.: Modules unimodulaires. J. Comb. Theory 4, 301\u2013362 (1968)","journal-title":"J. Comb. Theory"},{"key":"372_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand. Sect. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stand. Sect. B"},{"key":"372_CR10","unstructured":"Edmonds, J.: An introduction to matching. Mimeographed notes, Engineering Summer Conference, University of Michigan (1967)"},{"key":"372_CR11","unstructured":"Edmonds, J., Johnson, E.L.: Matching: a well-solved class of integer linear programs. In: Combinatorial Structures and their Applications (Proc. Calgary Internat., Calgary, Alta., 1969), pp. 89\u201392. New York, (1970)"},{"key":"372_CR12","unstructured":"Fonlupt, J., Raco, M.: Orientation of matrices. Math. Program. Stud. 22:86\u201398 (1984). Mathematical programming at Oberwolfach, II (Oberwolfach, 1983)"},{"key":"372_CR13","doi-asserted-by":"crossref","first-page":"3302","DOI":"10.1016\/j.disc.2006.06.015","volume":"306","author":"K. Fukuda","year":"2007","unstructured":"Fukuda K., Musitelli A.: New polynomial-time algorithms for camion bases. Discrete Math. 306, 3302\u20133306 (2007)","journal-title":"Discrete Math."},{"key":"372_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0024-3795(89)90461-8","volume":"114\/115","author":"A.M.H. Gerards","year":"1989","unstructured":"Gerards A.M.H.: A short proof of Tutte\u2019s characterization of totally unimodular matrices. Linear Algebra Appl. 114\/115, 207\u2013212 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"372_CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"A.M.H. Gerards","year":"1986","unstructured":"Gerards A.M.H., Schrijver A.: Matrices with the Edmonds-Johnson property. Combinatorica 6(4), 365\u2013379 (1986)","journal-title":"Combinatorica"},{"key":"372_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/sapm1958371193","volume":"37","author":"R. Gould","year":"1958","unstructured":"Gould R.: Graphs and vector spaces. J. Math. Phys. 37, 193\u2013214 (1958)","journal-title":"J. Math. Phys."},{"key":"372_CR17","unstructured":"Kotnyek, B.: A generalization of totally unimodular and network matrices. PhD thesis, London School of Economics (2002)"},{"key":"372_CR18","volume-title":"Combinatorial optimization: networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler E.L.: Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"372_CR19","unstructured":"Musitelli, A.: Recognition of generalized network matrices. PhD thesis, EPFL, Lausanne, http:\/\/www.arxiv.org (2007)"},{"key":"372_CR20","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons Ltd., Chichester, A Wiley-Interscience Publication (1986)"},{"issue":"6","key":"372_CR21","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF02574704","volume":"6","author":"A. Schrijver","year":"1991","unstructured":"Schrijver A.: Disjoint homotopic paths and trees in a planar graph. Discrete Comput. Geom. 6(6), 527\u2013574 (1991)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"372_CR22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"Seymour P.D.: Decomposition of regular matroids. J. Comb. Theory Ser. B 28(3), 305\u2013359 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"372_CR23","unstructured":"Seymour, P.D.: Applications of the regular matroid decomposition. In: Matroid Theory (Szeged, 1982). Colloquium on Mathematical Society of J\u00e1nos Bolyai, vol. 40, pp. 345\u2013357. North-Holland, Amsterdam (1985)"},{"key":"372_CR24","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00181486","volume":"8","author":"R.W. Shannon","year":"1979","unstructured":"Shannon R.W.: Simplicial cells in arrangements of hyperplanes. Geom. Dedic. 8, 179\u2013187 (1979)","journal-title":"Geom. Dedic."},{"key":"372_CR25","first-page":"144","volume":"88","author":"W.T. Tutte","year":"1958","unstructured":"Tutte W.T.: A homotopy theorem for matroids. I, II. Trans. Am. Math. Soc. 88, 144\u2013174 (1958)","journal-title":"Trans. Am. Math. Soc."},{"key":"372_CR26","first-page":"905","volume":"11","author":"W.T. Tutte","year":"1960","unstructured":"Tutte W.T.: An algorithm for determining whether a given binary matroid is graphic. Proc. Am. Math. Soc. 11, 905\u2013917 (1960)","journal-title":"Proc. Am. Math. Soc."},{"key":"372_CR27","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Lectures on matroids. J. Res. Natl. Bur. Stand. Sect. B 69B (1965)","DOI":"10.6028\/jres.069B.001"},{"key":"372_CR28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.6028\/jres.071B.028","volume":"71","author":"W.T. Tutte","year":"1967","unstructured":"Tutte W.T.: On even matroids. J. Res. Natl. Bur. Stand. Sect. B 71, 213\u2013214 (1967)","journal-title":"J. Res. Natl. Bur. Stand. Sect. B"},{"issue":"1\u20133","key":"372_CR29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.disc.2004.07.039","volume":"302","author":"G. Whittle","year":"2005","unstructured":"Whittle G.: Recent work in matroid representation theory. Discrete Math. 302(1\u20133), 285\u2013296 (2005)","journal-title":"Discrete Math."},{"issue":"1","key":"372_CR30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T. Zaslavsky","year":"1982","unstructured":"Zaslavsky T.: Signed graphs. Discrete Appl. Math. 4(1), 47\u201374 (1982)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"372_CR31","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0195-6698(13)80118-7","volume":"12","author":"T. Zaslavsky","year":"1991","unstructured":"Zaslavsky T.: Orientation of signed graphs. Eur. J. Comb. 12(4), 361\u2013375 (1991)","journal-title":"Eur. J. Comb."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0372-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0372-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0372-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T02:22:46Z","timestamp":1559182966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0372-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["372"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0372-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,13]]}}}