{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T03:40:05Z","timestamp":1775965205226,"version":"3.50.1"},"reference-count":61,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5662,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1002\/(sici)1097-0037(200003)35:2<91::aid-net1>3.0.co;2-t","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T01:26:51Z","timestamp":1031707611000},"page":"91-108","source":"Crossref","is-referenced-by-count":23,"title":["A truncated primal-infeasible dual-feasible network interior point method"],"prefix":"10.1002","volume":"35","author":[{"given":"L. F.","family":"Portugal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Veiga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. J.","family":"J\ufffddice","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB1","volume-title":"Network flows","author":"Ahuja","year":"1993","unstructured":"and Network flows, Prentice Hall, Englewood Cliffs, NJ, 1993."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB2","first-page":"26","volume":"28","author":"Armacost","year":"1991","journal-title":"Opsearch"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB3","author":"Aronson","year":"1985","unstructured":"and The projective transformation algorithm of Karmarkar: A computational experiment with assignment problems, Tech. Rep. 85-OR-3, Department of Operations Research, Southern Methodist University, Dallas, TX, August 1985."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB4","volume-title":"Linear network optimization: Algorithms and codes","author":"Bertsekas","year":"1991","unstructured":"Linear network optimization: Algorithms and codes, MIT Press, Cambridge, MA, 1991."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.36.1.93","volume":"36","author":"Bertsekas","year":"1988","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","volume":"24","author":"Bradley","year":"1977","journal-title":"Mgmt Sci"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB7","author":"CPLEX Optimization Inc.","year":"1994","unstructured":"CPLEX Optimization Inc., Using the CPLEX(TM) callable library and CPLEX(TM) mixed integer library including the CPLEX(TM) linear optimizer and CPLEX(TM) mixed integer optimizer?version 3.0, 1994."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB8","volume-title":"Activity analysis of production and allocation","author":"Dantzig","year":"1951","unstructured":"?Application of the simplex method to a transportation problem,? Activity analysis of production and allocation, (Editor), Wiley, New York, 1951."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"Dembo","year":"1982","journal-title":"SIAM J Num Anal"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"Dembo","year":"1983","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB11","author":"Dikin","year":"1991","unstructured":"Determination of interior point of a system of linear inequalities, Tech. Rep., Siberian Energy Institute, Irkutsk, USSR, 1991."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/1036003","volume":"36","author":"El-Bakry","year":"1994","journal-title":"SIAM Rev"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB13","volume-title":"Nonlinear programming: Sequential unconstrained minimization technique","author":"Fiacco","year":"1968","unstructured":"and Nonlinear programming: Sequential unconstrained minimization technique, Wiley, New York, 1968."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.24.1.50","volume":"24","author":"Freund","year":"1999","journal-title":"Math Oper Res"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB15","first-page":"18","volume":"9","author":"Fulkerson","year":"1961","journal-title":"J SIAM"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB16","author":"Gay","year":"1989","unstructured":"Stopping tests that compute optimal solutions for interior-point linear programming algorithms, Tech. Rep., AT&T Bell Laboratories, Murray Hill, NJ, 1989."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB17","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BFb0120942","volume":"15","author":"Glover","year":"1981","journal-title":"Math Program Study"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB18","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"Goldberg","year":"1988","journal-title":"J ACM"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB19","first-page":"1","author":"Goldberg","year":"1997","journal-title":"J Alg"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02288321","volume":"13","author":"Goldfarb","year":"1988","journal-title":"Ann Oper Res"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"Grigoriadis","year":"1986","journal-title":"Math Program Study"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB22","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"G\u00fcler","year":"1993","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB23","series-title":"DIMACS series","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/012","volume-title":"Network flows and matching: First DIMACS implementation challenge","volume":"12","author":"Johnson","year":"1993","unstructured":"and (Editors), Network flows and matching: First DIMACS implementation challenge, Vol. 12, DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society, Providence, Rhode Island 1993."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB24","author":"Johnson","year":"1965","unstructured":"Programming in networks and graphs, Tech. Rep. ORC 65-1, Operations Research Center, University of California, Berkeley, CA, 1965."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB25","series-title":"DIMACS series","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1090\/dimacs\/012\/11","volume-title":"Network flows and matching: First DIMACS implementation challenge","volume":"12","author":"Joshi","year":"1993","unstructured":"and ?A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope,? Network flows and matching: First DIMACS implementation challenge, and (Editors), Vol. 12, DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society, Providence, Rhode Island 1993, pp. 267-298."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB26","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/mnsc.39.6.757","volume":"39","author":"Kaliski","year":"1993","journal-title":"Mgmt Sci"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB27","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB28","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01582905","volume":"52","author":"Karmarkar","year":"1991","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB29","volume-title":"Algorithms for network programming","author":"Kennington","year":"1980","unstructured":"and Algorithms for network programming, Wiley, New York, 1980."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB30","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"Kojima","year":"1993","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB31","first-page":"29","volume-title":"Progress in mathematical programming, interior point and related methods","author":"Kojima","year":"1989","unstructured":"and ?A primal-dual interior point algorithm for linear programming,? Progress in mathematical programming, interior point and related methods, (Editor), Springer, New York 1989, pp. 29-47."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB32","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc Am Math Soc"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"Lustig","year":"1994","journal-title":"ORSA J Comput"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB34","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/ijoc.6.1.35","volume":"6","author":"Lustig","year":"1994","journal-title":"ORSA J Comput"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB35","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"McShane","year":"1989","journal-title":"ORSA J Comput"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB36","first-page":"131","volume-title":"Progress in mathematical programming, interior point and related methods","author":"Megiddo","year":"1989","unstructured":"?Pathways to the optimal set in linear programming,? Progress in mathematical programming, interior point and related methods, (Editor), Springer, New York 1989, 131-158."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB37","author":"Mehrotra","year":"1990","unstructured":"On the implementation of a (primal-dual) interior point method. TR 90-03, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208, 1990."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB38","volume-title":"Linear and nonlinear conjugate gradient related methods","author":"Mehrotra","year":"1995","unstructured":"and ?Conjugate gradient based implementation of interior point methods for network flow problems,? Linear and nonlinear conjugate gradient related methods, and (Editors), SIAM, Philadelphia 1995."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB39","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF01585180","author":"Mehrotra","year":"1993","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB40","first-page":"148","volume":"31","author":"Meijerink","year":"1977","journal-title":"Math Comput"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB41","series-title":"Research memo","volume-title":"Global and polynomial time convergence of an infeasible interior point algorithm using inexact computation","author":"Mizuno","year":"1996","unstructured":"and Global and polynomial time convergence of an infeasible interior point algorithm using inexact computation, Research memorandum 605, Institute of Statistical Mathematics, Tokyo, Japan, 1996."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB42","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"Monteiro","year":"1989","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB43","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02023109","volume":"47","author":"Monteiro","year":"1993","journal-title":"Ann Oper Res"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB44","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01609034","volume":"15","author":"Mulvey","year":"1978","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB45","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1137\/S1064827593258280","volume":"17","author":"Portugal","year":"1996","journal-title":"SIAM J Sci Comput"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB46","author":"Portugal","year":"1998","unstructured":"and Preconditioners for interior point network flow methods, Tech. Rep. AT&T Labs Research, Florham Park, NJ, 1998."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB47","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst Tech J"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB48","author":"Rajan","year":"1989","unstructured":"An empirical comparison of KORBX against\/break RELAXT, a special code for network flow problems, Tech. Rep., AT&T Bell Laboratories, Holmdel, NJ, 1989."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB49","series-title":"DIMACS series","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1090\/dimacs\/012\/17","volume-title":"Network flows and matching: First DIMACS implementation challenge","volume":"12","author":"Ramakrishnan","year":"1993","unstructured":"and ?An approximate dual projective algorithm for solving assignment problems,? in Network flows and matching: First DIMACS implementation challenge, and (Editors), Vol. 12, DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society, Providence, Rhode Island 1993, pp. 431-451."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB50","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/978-1-4613-3632-7_18","volume-title":"Large scale optimization: State of the art","author":"Resende","year":"1994","unstructured":"and ?Identifying the optimal face of a network linear program with a globally convergent interior point method,? Large scale optimization: State of the art, and (Editors), Kluwer, Boston 1994, pp. 362-387."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB51","first-page":"81","volume":"3","author":"Resende","year":"1993","journal-title":"Invest Oper"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB52","series-title":"DIMACS series","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/dimacs\/012\/12","volume-title":"Network flows and matching: First DIMACS implementation challenge","volume":"12","author":"Resende","year":"1993","unstructured":"and ?An efficient implementation of a network interior point method,? Network flows and matching: First DIMACS implementation challenge, and (Editors), Vol. 12, DIMACS series in discrete mathematics and theoretical computer science, American Mathematical Society, Providence, Rhode Island 1993, pp. 299-348."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB53","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/0803025","volume":"3","author":"Resende","year":"1993","journal-title":"SIAM J Optim"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB54","first-page":"147","volume-title":"Advances in linear and integer programming","author":"Resende","year":"1996","unstructured":"and Interior point algorithms for network flow problems, Advances in linear and integer programming, (Editor), Oxford University Press, New York 1996, pp. 147-187."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB55","series-title":"Fortran codes","volume-title":"Annals of operations research","volume":"13","author":"Simeone","year":"1988","unstructured":"and (Editors), Fortran codes for network optimization, Vol. 13, Annals of operations research, J.C. Baltzer, Basel, Switzerland, 1988."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB56","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0042787","volume-title":"System modeling and optimization","author":"Tanabe","year":"1988","unstructured":"?Centered Newton method for mathematical programming,? System modeling and optimization, and (Editors), Springer, New York 1988, pp. 197-206."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB57","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"Tarjan","year":"1983","unstructured":"Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983."},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB58","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0805027","volume":"5","author":"Tsuchiya","year":"1995","journal-title":"SIAM J Optim"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB59","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"Vaidya","year":"1990","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB60","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581087","volume":"57","author":"Ye","year":"1992","journal-title":"Math Program"},{"key":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T-BIB61","author":"Yeh","year":"1989","unstructured":"A reduced dual affine scaling algorithm for solving assignment and transportation problems, PhD thesis, Columbia University, New York, 1989."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(200003)35:2%3C91::AID-NET1%3E3.0.CO;2-T","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(200003)35:2%3C91::AID-NET1%3E3.0.CO;2-T","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:17:26Z","timestamp":1625134646000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(200003)35:2<91::aid-net1>3.0.co;2-t","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}