{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:47:36Z","timestamp":1752461256652,"version":"3.41.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1023\/a:1008791601215","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"235-247","source":"Crossref","is-referenced-by-count":8,"title":["Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms"],"prefix":"10.1007","volume":"15","author":[{"given":"Nal\u00e2n","family":"G\u00fclpinar","sequence":"first","affiliation":[]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]},{"given":"Gautam","family":"Mitra","sequence":"additional","affiliation":[]},{"given":"Istv\u00e1n","family":"Maros","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"255803_CR1","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993."},{"key":"255803_CR2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0377-2217(93)90321-D","volume":"67","author":"B.M. Baker","year":"1993","unstructured":"B.M. Baker and P.J. Maye, \u201cA heuristic for finding embedded network structure in mathematical programs,\u201d European Journal of Operational Research, vol. 67, pp. 52-63, 1993.","journal-title":"European Journal of Operational Research"},{"key":"255803_CR3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0167-6377(82)90038-4","volume":"1","author":"J.J. Bartholdi","year":"1982","unstructured":"J.J. Bartholdi, \u201cA good submatrix is hard to find,\u201d Operations Research Letters, vol. 1, pp. 190-193, 1982.","journal-title":"Operations Research Letters"},{"issue":"3","key":"255803_CR4","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/mnsc.34.3.342","volume":"34","author":"R.E. Bixby","year":"1988","unstructured":"R.E. Bixby and R. Fourer, \u201cFinding embedded network rows in linear programs I. Extraction heuristics,\u201d Management Science, vol. 34, no. 3, pp. 342-376, 1988.","journal-title":"Management Science"},{"key":"255803_CR5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A.L. Brearley","year":"1975","unstructured":"A.L. Brearley, G. Mitra, and H.P. Williams, \u201cAnalysis of mathematical programming problems prior to applying the simplex algorithm,\u201d Mathematical Programming, vol. 8, pp. 54-83, 1975.","journal-title":"Mathematical Programming"},{"key":"255803_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01582564","volume":"64","author":"G.G. Brown","year":"1994","unstructured":"G.G. Brown and M.P. Olson, \u201cDynamic factorization in large-scale optimization,\u201d Mathematical Programming, vol. 64, pp. 17-51, 1994.","journal-title":"Mathematical Programming"},{"key":"255803_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02591728","volume":"29","author":"G.G. Brown","year":"1984","unstructured":"G.G. Brown and W.G. Wright, \u201cAutomatic identification of embedded network rows in large-scale optimization models,\u201d Mathematical Programming, vol. 29, pp. 41-56, 1984.","journal-title":"Mathematical Programming"},{"issue":"11","key":"255803_CR8","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1287\/mnsc.26.11.1166","volume":"26","author":"G.G. Brown","year":"1980","unstructured":"G.G. Brown and D.S. Thomen, \u201cAutomatic identification of generalized upper bounds in large-scale optimization models,\u201d Management Science, vol. 26, no. 11, pp. 1166-1184, 1980.","journal-title":"Management Science"},{"key":"255803_CR9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/B978-0-12-299680-1.50026-4","volume-title":"Computer-Assisted Analysis and Model Simplification","author":"G.G. Brown","year":"1981","unstructured":"G.G. Brown and W.G. Wright, \u201cAutomatic identification of embedded structure in large-scale optimization models,\u201d in Computer-Assisted Analysis and Model Simplification, H. Greenberg and J. Maybee (Eds.), Academic Press: New York, 1981, pp. 369-388."},{"key":"255803_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"G.B. Dantzig and R.M. Van Slyke, \u201cGeneralized upper bounding techniques,\u201d Journal of Computer and System Sciences, vol. 1, pp. 213-226, 1967.","journal-title":"Journal of Computer and System Sciences"},{"key":"255803_CR11","volume-title":"Direct Methods for Sparse Matrices","author":"S. Duff","year":"1986","unstructured":"S. Duff, A.M. Erisman, and J.K. Reid, Direct Methods for Sparse Matrices, Oxford University Press: Oxford-London, 1986."},{"key":"255803_CR12","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201d Mathematical Programming Society, Coal, Newsletter, vol. 13, pp. 10-12, 1985.","journal-title":"Mathematical Programming Society, Coal, Newsletter"},{"key":"255803_CR13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BFb0120942","volume":"15","author":"F. Glover","year":"1971","unstructured":"F. Glover and D. Klingman, \u201cThe simplex SON algorithm for LP\/embedded network problems,\u201d Mathematical Programming Study, vol. 15, pp. 148-176, 1971.","journal-title":"Mathematical Programming Study"},{"key":"255803_CR14","doi-asserted-by":"crossref","unstructured":"H.J. Greenberg, \u201cA functional description of analyze: A computer assisted analysis system for linear programming models,\u201d ACM Trans. Math. Software, vol. 9, no. 1, 1983.","DOI":"10.1145\/356022.356024"},{"key":"255803_CR15","unstructured":"N. G\u00fclp\u0131nar, G. Gutin, and G. Mitra, \u201cDetecting embedded pure network structure using independent set algorithms,\u201d Technical Report, TR\/12\/97, Brunel University, 1997."},{"key":"255803_CR16","unstructured":"N. G\u00fclp\u0131nar, I. Maros, and G. Mitra, \u201cDetecting pure embedded network structures in large-scale LP problems,\u201d Technical Report, TR\/20\/96, Brunel University, 1996."},{"key":"255803_CR17","unstructured":"N. G\u00fclp\u0131nar, G. Mitra, and I. Maros, \u201cCreating advanced starting basis for large scale programs exploiting embedded network structures,\u201d Technical Report, TR\/04\/98, Brunel University, 1998."},{"key":"255803_CR18","unstructured":"A. Hsu and R. Fourer, \u201cExploiting network structure for solving large scale linear programming models,\u201d Working Paper, Jan. 1996."},{"key":"255803_CR19","unstructured":"S. Khanna, R. Motwani, M. Sudan, and U. Vazirani, \u201cOn syntactic versus computational views of approximately,\u201d in Proceedings Symposium on Foundations of Computer Science, 1994."},{"key":"255803_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"H.M. Markowitz","year":"1957","unstructured":"H.M. Markowitz, \u201cThe elimination form of the inverse and its application to linear programming,\u201d Management Science, vol. 3, pp. 255-267, 1957.","journal-title":"Management Science"},{"issue":"2","key":"255803_CR21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0377-2217(96)00402-X","volume":"101","author":"E. Messina","year":"1997","unstructured":"E. Messina and G. Mitra, \u201cModelling and analysis of multi-stage stochastic programming problems: A software environment,\u201d European Journal of Operational Research, vol. 101, no. 2, pp. 343-359, 1997.","journal-title":"European Journal of Operational Research"},{"key":"255803_CR22","doi-asserted-by":"crossref","unstructured":"G. Mitra and M. Tamiz, \u201cAlternative methods for representing the inverse of linear programming basis matrices,\u201d in Recent Developments in Mathematical Programming, S. Kumar (Ed.), 1991, pp. 273-301.","DOI":"10.1201\/9780429333439-17"},{"key":"255803_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(92)90248-T","volume":"44","author":"V.T. Paschos","year":"1992","unstructured":"V.T. Paschos, \u201cA (\u03b4\/2)-approximation algorithm for the maximum independent set problem,\u201d Information Processing Letters, vol. 44, pp. 11-13, 1992.","journal-title":"Information Processing Letters"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008791601215.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008791601215\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008791601215.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:19:21Z","timestamp":1752376761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008791601215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["255803"],"URL":"https:\/\/doi.org\/10.1023\/a:1008791601215","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}