{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:50:25Z","timestamp":1649044225046},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1016\/s0377-2217(97)00167-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:17:54Z","timestamp":1027599474000},"page":"452-463","source":"Crossref","is-referenced-by-count":1,"title":["Computational implementation of Fujishige's graph realizability algorithm"],"prefix":"10.1016","volume":"108","author":[{"given":"Agha Iqbal","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun-Soo","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00167-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB2","series-title":"Progress in Combinatorial Optimization","first-page":"39","article-title":"Recent algorithms for two versions of graph realization and remarks on applications to linear programming","author":"Bixby","year":"1984"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","article-title":"Converting linear programs to network problems","volume":"5","author":"Bixby","year":"1980","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB4","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/mnsc.34.3.342","article-title":"Finding embedded network rows in linear programs, I. Extraction heuristics","volume":"34","author":"Bixby","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(82)90244-0","article-title":"Seperating cocircuits in binary matroids","volume":"43","author":"Cunningham","year":"1982","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","article-title":"An efficient PQ-graph algorithm for solving the graph realization problems","volume":"21","author":"Fujishige","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","article-title":"Improving LP-representations of zero-one linear programs for branch and cut","volume":"3","author":"Hoffman","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB10","first-page":"376","article-title":"On the synthesis of loop and cutset matrices and related problems","volume":"4","author":"Iri","year":"1968","journal-title":"RAAG Memoirs"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB11","first-page":"158","article-title":"Irredundant and redundant Boolean branch networks","author":"Lofgren","year":"1959","journal-title":"IRE Transactions on Circuit Theory CT-6"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1287\/opre.42.1.5","article-title":"The age of optimization: solving large scale real world problems","volume":"42","author":"Nemhauser","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02579179","article-title":"Decomposition of regular matroids","volume":"1","author":"Seymour","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB14","first-page":"905","article-title":"An algorithm for determining whether a given binary mairoid is graphic","volume":"11","author":"Tutte","year":"1960"},{"key":"10.1016\/S0377-2217(97)00167-7_BIB15","doi-asserted-by":"crossref","first-page":"108","DOI":"10.4153\/CJM-1964-011-0","article-title":"From matrices to graphs","volume":"16","author":"Tutte","year":"1964","journal-title":"Canadian Journal of Mathematics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001677?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001677?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:58:44Z","timestamp":1556657924000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797001677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0377221797001677"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00167-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}