{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:03:14Z","timestamp":1772740994646,"version":"3.50.1"},"reference-count":18,"publisher":"FapUNIFESP (SciELO)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pesqui. Oper."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>We describe Fortran subroutines for network flow optimization using an interior point network flow algorithm, that, together with a Fortran language driver, make up PDNET. The algorithm is described in detail and its implementation is outlined. Usage of the package is described and some computational experiments are reported. Source code for the software can be downloaded at http:\/\/www.research.att.com\/~mgcr\/pdnet.<\/jats:p>","DOI":"10.1590\/s0101-74382008000200005","type":"journal-article","created":{"date-parts":[[2008,10,22]],"date-time":"2008-10-22T15:07:09Z","timestamp":1224688029000},"page":"243-261","source":"Crossref","is-referenced-by-count":3,"title":["Fortran subroutines for network flow optimization using an interior point algorithm"],"prefix":"10.1590","volume":"28","author":[{"given":"L. F.","family":"Portugal","sequence":"first","affiliation":[{"name":"Universidade de Coimbra,  Portugal"}]},{"given":"M. G. C.","family":"Resende","sequence":"additional","affiliation":[{"name":"Internet and Network Systems Research Center,  USA"}]},{"given":"G.","family":"Veiga","sequence":"additional","affiliation":[{"name":"HTF Software,  Brazil"}]},{"given":"J.","family":"Patr\u00edcio","sequence":"additional","affiliation":[{"name":"Tomar; Portugal,  Portugal"}]},{"given":"J. J.","family":"J\u00fadice","sequence":"additional","affiliation":[{"name":"Univ. de Coimbra; Coimbra,  Portugal"}]}],"member":"530","reference":[{"key":"ref1","series-title":"Network Flows","author":"Ahuja N.K.","year":"1993"},{"key":"ref2","series-title":"The first DIMACS international algorithm implementation challenge: Problem definitions and specifications","year":"1991"},{"key":"ref3","series-title":"The first DIMACS international algorithm implementation challenge: The benchmark experiments","year":"1991"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/1036003","article-title":"A study on the use of indicators for identifying zero variables for interior-point methods","volume":"36","author":"El-Bakry A.S.","year":"1994","journal-title":"SIAM Review"},{"key":"ref5","series-title":"Stopping tests that compute optimal solutions for interior-point linear programming algorithms","author":"Gay D.M.","year":"1989"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02288321","article-title":"A computational comparison of the Dinic and network simplex methods for maximum flow","volume":"13","author":"Goldfarb D.","year":"1988","journal-title":"Annals of Operations Research"},{"key":"ref7","series-title":"Information technology - Programming languages - Fortran - Part 1: Base language. ISO\/IEC 1539-1:1997","year":"1997"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01582905","article-title":"Computational results of an interior point algorithm for large scale linear programming","volume":"52","author":"Karmarkar N.K.","year":"1991","journal-title":"Mathematical Programming"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","article-title":"An implementation of a primal-dual interior point method for linear programming","volume":"1","author":"McShane K.A.","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF01585180","article-title":"Finding an interior point in the optimal face of linear programs","volume":"62","author":"Mehrotra S.","year":"1993","journal-title":"Mathematical Programming"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1137\/S1064827593258280","article-title":"An investigation of interior point algorithms for the linear transportation problem","volume":"17","author":"Portugal L.","year":"1996","journal-title":"SIAM J. Sci. Computing"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T","article-title":"A truncated primal-infeasible dual-feasible network interior point method","volume":"35","author":"Portugal L.F.","year":"2000","journal-title":"Networks"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim R.C.","year":"1957","journal-title":"Bell System Technical Journal","ISSN":"https:\/\/id.crossref.org\/issn\/0005-8580","issn-type":"print"},{"key":"ref14","first-page":"81","article-title":"Computing the projection in an interior point algorithm: An experimental comparison","volume":"3","author":"Resende M.G.C.","year":"1993","journal-title":"Investigaci\u00f3n Operativa"},{"key":"ref15","series-title":"Network Flows and Matching: First DIMACS Implementation Challenge","first-page":"299","volume-title":"An efficient implementation of a network interior point method","volume":"12","author":"Resende M.G.C.","year":"1993"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/0803025","article-title":"An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks","volume":"3","author":"Resende M.G.C.","year":"1993","journal-title":"SIAM Journal on Optimization"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581087","article-title":"On the finite convergence of interior-point algorithms for linear programming","volume":"57","author":"Ye Y.","year":"1992","journal-title":"Mathematical Programming"},{"key":"ref18","series-title":"A reduced dual affine scaling algorithm for solving assignment and transportation problems","author":"Yeh Quey-Jen","year":"1989"}],"container-title":["Pesquisa Operacional"],"original-title":[],"link":[{"URL":"http:\/\/www.scielo.br\/pdf\/pope\/v28n2\/05.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T04:05:02Z","timestamp":1495771502000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.scielo.br\/scielo.php?script=sci_arttext&pid=S0101-74382008000200005&lng=en&tlng=en"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["S0101-74382008000200005"],"URL":"https:\/\/doi.org\/10.1590\/s0101-74382008000200005","relation":{},"ISSN":["0101-7438"],"issn-type":[{"value":"0101-7438","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}