{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:09Z","timestamp":1752378009084,"version":"3.41.2"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002,1]]},"DOI":"10.1023\/a:1013548430005","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T16:58:59Z","timestamp":1040662739000},"page":"71-93","source":"Crossref","is-referenced-by-count":4,"title":["Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure"],"prefix":"10.1007","volume":"21","author":[{"given":"Nal\u00e2v","family":"G\u00fclpinar","sequence":"first","affiliation":[]},{"given":"Gautam","family":"Mitra","sequence":"additional","affiliation":[]},{"given":"Istv\u00e1n","family":"Maros","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"390817_CR1","volume-title":"Network Flows: Theory and Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory and Algorithms, and Applications, Prentice-Hall; Englewood Cliffs, NJ, 1993."},{"key":"390817_CR2","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(89)90471-2","volume":"38","author":"A.I. Ali","year":"1989","unstructured":"A.I. Ali and T. Hemalatha, \u201cA network relaxation based enumeration algorithm for set partitioning,\u201d European Journal of Operational Research, vol. 38, pp. 76\u201385, 1989.","journal-title":"European Journal of Operational Research"},{"key":"390817_CR3","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"J.E. Beasley","year":"1993","unstructured":"J.E. Beasley, \u201cLagrangean relaxation,\u201d in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves (Ed.), Blackwell Scientific Publications: Oxford, 1993."},{"key":"390817_CR4","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, \u201cPartitioning procedures for solving mixed-variables programming problems,\u201d Numerische Mathematik, vol. 4, pp. 238\u2013252, 1962.","journal-title":"Numerische Mathematik"},{"issue":"3","key":"390817_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.4.3.267","volume":"4","author":"R. Bixby","year":"1992","unstructured":"R. Bixby, \u201cImplementing simplex method: The initial basis,\u201d ORSA Journal On Computing, vol 4, no. 3, pp. 267\u2013284, 1992.","journal-title":"ORSA Journal On Computing"},{"issue":"3","key":"390817_CR6","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/mnsc.34.3.342","volume":"34","author":"R. Bixby","year":"1988","unstructured":"R. Bixby and R. Fourer, \u201cFinding embedded network rows in linear programs I. Extraction heuristics,\u201d Management Science, vol. 34, no. 3, pp. 342\u2013376, 1988.","journal-title":"Management Science"},{"key":"390817_CR7","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\u201351, 1994.","journal-title":"Mathematical Programming"},{"issue":"2","key":"390817_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0305-0548(91)90084-5","volume":"18","author":"N. Bryson","year":"1991","unstructured":"N. Bryson, \u201cParametric programming and Lagrangian relaxation: The case of the network problem with a single side constraint,\u201d Computers and Operations Research, vol. 18, no. 2, pp. 129\u2013140, 1991.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"390817_CR9","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/0305-0548(93)90017-D","volume":"20","author":"N. Bryson","year":"1993","unstructured":"N. Bryson, \u201cA parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints,\u201d Computers and Operations Research, vol. 20, no. 5, pp. 541\u2013552, 1993.","journal-title":"Computers and Operations Research"},{"key":"390817_CR10","first-page":"131","volume-title":"Advanced Linear Programming ComputingTechniques","author":"D.M. Carstens","year":"1968","unstructured":"D.M. Carstens, \u201cCrashing techniques,\u201d in Advanced Linear Programming ComputingTechniques, W. Orchard-Hays (Ed.), McGraw-Hill: New York, 1968, pp. 131\u2013141."},{"key":"390817_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230070105","volume":"7","author":"S. Chen","year":"1977","unstructured":"S. Chen and R. Saigal, \u201cA primal algorithm for solving a capacitated network flow problem with additional constraints,\u201d Networks, vol. 7, pp. 59\u201379, 1977.","journal-title":"Networks"},{"key":"390817_CR12","volume-title":"A Fortran Based Mathematical Programming System: FortMP","author":"E.F.D. Ellison","year":"1995","unstructured":"E.F.D. Ellison, M. Hajian, R. Levkovitz, I. Maros, and G. Mitra, A Fortran Based Mathematical Programming System: FortMP, Brunel University: London and NAG: Oxford, 1995."},{"issue":"1","key":"390817_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M. Fisher","year":"1981","unstructured":"M. Fisher, \u201cThe Lagrangean relaxation method for solving integer programming problems,\u201d Management Science, vol. 27, no. 1, pp. 1\u201318, 1981.","journal-title":"Management Science"},{"issue":"9","key":"390817_CR14","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M. Fisher","year":"1986","unstructured":"M. Fisher, R. Jaikumar, and L.N.V. Wassenhove, \u201cA multiplier adjustment method for the generalized assignment problem,\u201d Management Science, vol. 32, no. 9, pp. 1095\u20131103, 1986.","journal-title":"Management Science"},{"key":"390817_CR15","unstructured":"R. Fourer and A.C. Hsu, \u201cExploiting network structure for solving large-scale linear programming models,\u201d Working Paper, 1996."},{"key":"390817_CR16","unstructured":"A. Frangioni, \u201cMulticommodity min cost flow problems,\u201d http:\/\/www.di.unipi.it\/di\/groups\/ optimize\/Data\/MMCF.html"},{"key":"390817_CR17","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\u201312, 1985.","journal-title":"Mathematical Programming Society Coal"},{"key":"390817_CR18","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, \u201cLagrangean relaxation for integer programming,\u201d Mathematical Programming Study, vol. 2, pp. 82\u2013114, 1974.","journal-title":"Mathematical Programming Study"},{"issue":"4","key":"390817_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/trsc.12.4.277","volume":"12","author":"F. Glover","year":"1978","unstructured":"F. Glover, D. Karney, D. Klingman, and R. Russel, \u201cSolving singly constrained transshipment problems,\u201d Transportation Science, vol. 12, no. 4, pp. 277\u2013297, 1978.","journal-title":"Transportation Science"},{"key":"390817_CR20","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BFb0120942","volume":"15","author":"F. Glover","year":"1981","unstructured":"F. Glover and D. Klingman, \u201cThe simplex SON algorithm for LP\/embedded network problems,\u201d Mathematical Programming Study, vol. 15, pp. 148\u2013176, 1981.","journal-title":"Mathematical Programming Study"},{"key":"390817_CR21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BFb0121048","volume":"24","author":"F. Glover","year":"1985","unstructured":"F. Glover and D. Klingman, \u201cBasis exchange characterizations for the simplex SON algorithm for LP\/embedded networks,\u201d Mathematical Programming Study, vol. 24, pp. 141\u2013157, 1985.","journal-title":"Mathematical Programming Study"},{"key":"390817_CR22","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/BF01589115","volume":"45","author":"N.I.M. Gould","year":"1989","unstructured":"N.I.M. Gould and J.K. Reid, \u201cNew crash procedures for large systems of linear constraints,\u201d Mathematical Programming, vol. 45, pp. 475\u2013501, 1989.","journal-title":"Mathematical Programming"},{"key":"390817_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(88)90029-X","volume":"35","author":"M. Guignard","year":"1988","unstructured":"M. Guignard, \u201cA Lagrangean dual ascent algorithm for simple plant location problems,\u201d European Journal of Operational Research, vol. 35, pp. 193\u2013200, 1988.","journal-title":"European Journal of Operational Research"},{"key":"390817_CR24","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0377-2217(89)90213-0","volume":"43","author":"M. Guignard","year":"1989","unstructured":"M. Guignard and B. Rosenwein, \u201cAn application oriented guide for designing Lagrangean dual ascent algorithms,\u201d European Journal of Operational Research, vol. 43, pp. 197\u2013205, 1989.","journal-title":"European Journal of Operational Research"},{"key":"390817_CR25","unstructured":"N. G\u00fclpinar, G. Gutin, and G. Mitra, \u201cDetecting embedded pure network structures by using independent set algorithm,\u201d Brunel University, TR\/12\/97, 1997."},{"key":"390817_CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1008791601215","volume":"15","author":"N. G\u00fclpinar","year":"2000","unstructured":"N. G\u00fclpinar, G. Gutin, G. Mitra, and I. Maros, \u201cDetecting embedded pure network structures using GUB and independent set algorithms,\u201d Computational Optimization and Applications, vol. 15, pp. 235\u2013247, 2000.","journal-title":"Computational Optimization and Applications"},{"key":"390817_CR27","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, \u201cThe travelling salesman problem and minimum spanning trees,\u201d Operations Research, vol. 18, pp. 1138\u20131162, 1970.","journal-title":"Operations Research"},{"key":"390817_CR28","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R.M. Karp, \u201cThe travelling salesman problem and minimum spanning trees, Part II, Mathematical Programming, vol. 1, pp. 6\u201325, 1971.","journal-title":"Mathematical Programming"},{"key":"390817_CR29","volume-title":"Planning Under Uncertainty: Solving Large Scale Stochastic Linear Program","author":"G. Infanger","year":"1994","unstructured":"G. Infanger, Planning Under Uncertainty: Solving Large Scale Stochastic Linear Program, Boyd and Fraser: Danvers, MA, 1994."},{"issue":"5","key":"390817_CR30","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1287\/mnsc.46.5.693.12042","volume":"46","author":"J.W. Mamer","year":"2000","unstructured":"J.W. Mamer and R.D. McBride, \u201cA decomposition-based pricing procedure for large-scale linear programs: An application to linear multicommodity flow problem,\u201d Management Science, vol. 46, no. 5, pp. 693\u2013709, 2000.","journal-title":"Management Science"},{"key":"390817_CR31","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF02023108","volume":"47","author":"I. Maros","year":"1993","unstructured":"I. Maros, \u201cA practical anti-degeneracy row selection technique in network linear programming,\u201d Annals of Operations Research, vol. 47, pp. 431\u2013442, 1993.","journal-title":"Annals of Operations Research"},{"key":"390817_CR32","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/dimacs\/012\/08","volume":"2","author":"I. Maros","year":"1993","unstructured":"I. Maros, \u201cPerformance evaluation of the MINET minimum cost netflow solver,\u201d DIMACS Series in Discrete Mathematics and Computer Science, vol. 2, pp. 199\u2013217, 1993.","journal-title":"DIMACS Series in Discrete Mathematics and Computer Science"},{"key":"390817_CR33","first-page":"1","volume-title":"Advances in Linear and Integer Programming","author":"I. Maros","year":"1996","unstructured":"I. Maros and G. Mitra, \u201cSimplex algorithms,\u201d in Advances in Linear and Integer Programming, J., Beasley, (Ed.), Oxford University Press: Oxford, UK, 1996, pp. 1\u201346."},{"key":"390817_CR34","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-3-642-80117-4_2","volume-title":"Operations Research Proceedings 1995","author":"I. Maros","year":"1996","unstructured":"I. Maros and G. Mitra, \u201cFinding better starting bases for simplex method,\u201d In Operations Research Proceedings 1995, P. Kleinschmidt (Ed.), Springer: Berlin, 1996, pp. 7\u201312."},{"issue":"2","key":"390817_CR35","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/ijoc.10.2.248","volume":"10","author":"I. Maros","year":"1998","unstructured":"I. Maros and G. Mitra, \u201cStrategies for creating advanced bases for large-scale linear programming problems,\u201d Informs Journal on Computing, vol. 10, no. 2, pp. 248\u2013260, 1998.","journal-title":"Informs Journal on Computing"},{"key":"390817_CR36","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/S0305-0548(98)00001-X","volume":"25","author":"S. Mathies","year":"1998","unstructured":"S. Mathies and P. Mevert, \u201cA hybrid algorithm for solving network flow problems with side constraints,\u201d Computers and Operations Research, vol. 25, pp. 745\u2013756, 1998.","journal-title":"Computers and Operations Research"},{"key":"390817_CR37","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(85)90091-8","volume":"21","author":"R.D. McBride","year":"1985","unstructured":"R.D. McBride, \u201cSolving embedded generalised network problems,\u201d European Journal of Operational Research, vol. 21, pp. 82\u201392, 1985.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"390817_CR38","first-page":"154","volume":"9","author":"R.D. McBride","year":"1997","unstructured":"R.D. McBride and J.W. Mamer, \u201cSolving multicommodity flow problems with a embedded network simplex algorithm,\u201d Journal on Computing, vol. 9, no. 2, pp. 154\u2013163, 1997.","journal-title":"Journal on Computing"},{"issue":"2","key":"390817_CR39","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/inte.28.2.32","volume":"28","author":"R.D. McBride","year":"1998","unstructured":"R.D. McBride, \u201cAdvances in solving multicommodity flow problem,\u201d Interfaces, vol. 28, no. 2, pp. 32\u201341, 1998.","journal-title":"Interfaces"},{"key":"390817_CR40","doi-asserted-by":"crossref","unstructured":"D.F. Rogers, R.D. Plante, R.T.Wong, and J.R. Evans, \u201cAggregation and disaggregation techniques and methodology in optimisation,\u201d Operations Research, vol. 39, no. 4, 1991.","DOI":"10.1287\/opre.39.4.553"},{"key":"390817_CR41","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02216933","volume":"20","author":"M.A. Venkataramanan","year":"1989","unstructured":"M.A. Venkataramanan, J.J. Dinkel, and J. Mote, \u201cAsurrogate and Lagrangian approach to constrained network problems,\u201d Annals of Operations Research, vol. 20, pp. 283\u2013302, 1989.","journal-title":"Annals of Operations Research"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013548430005.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013548430005\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013548430005.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:27:47Z","timestamp":1752377267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013548430005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["390817"],"URL":"https:\/\/doi.org\/10.1023\/a:1013548430005","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}