{"id":"https://openalex.org/W2408225058","doi":"https://doi.org/10.1090/dimacs/012/12","title":"An efficient implementation of a network interior point method","display_name":"An efficient implementation of a network interior point method","publication_year":1993,"publication_date":"1993-10-01","ids":{"openalex":"https://openalex.org/W2408225058","doi":"https://doi.org/10.1090/dimacs/012/12","mag":"2408225058"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/012/12","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/012/12","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mauricio Resende","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021921216","display_name":"Geraldo Veiga","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Geraldo Veiga","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029261812"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":29.6919,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.9978836,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9384999871253967,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9384999871253967,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5307037234306335},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5187163949012756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2688688635826111},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1597624123096466}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5307037234306335},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5187163949012756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2688688635826111},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1597624123096466}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/012/12","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/012/12","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.4192","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.4192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.codiciel.fr/netlib/att/math/people/mgcr/doc/dlnet.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2086867325","https://openalex.org/W1561880747","https://openalex.org/W1518039036","https://openalex.org/W1977545325","https://openalex.org/W2611147814","https://openalex.org/W1981053712","https://openalex.org/W2047316561","https://openalex.org/W2045721235","https://openalex.org/W2033982221","https://openalex.org/W2002576214","https://openalex.org/W1981315194","https://openalex.org/W1964540128","https://openalex.org/W2798909945","https://openalex.org/W2338905098","https://openalex.org/W2013945499","https://openalex.org/W2085548605","https://openalex.org/W1997442930","https://openalex.org/W1996410010","https://openalex.org/W1964119857","https://openalex.org/W1573409602"],"abstract_inverted_index":{".":[0],"We":[1,98],"describe":[2],"dlnet,":[3],"an":[4,61,111],"implementation":[5,23],"of":[6,21,27,33,42,68,91,114,142],"the":[7,25,30,43,48],"dual":[8],"affine":[9],"scaling":[10],"algorithm":[11,56],"for":[12],"minimum":[13,78,115,121],"cost":[14,79,116,122],"capacitated":[15],"network":[16,80,102,117],"flow":[17,81,118,125],"problems.":[18,128],"The":[19,66,129],"efficiency":[20],"this":[22],"is":[24],"result":[26],"three":[28],"factors:":[29],"small":[31],"number":[32],"iterations":[34],"taken":[35],"by":[36],"interior":[37],"point":[38],"methods,":[39],"efficient":[40],"solution":[41],"linear":[44],"system":[45],"that":[46,75,133],"determines":[47],"ascent":[49],"direction":[50],"using":[51],"a":[52,73,88,95],"preconditioned":[53],"conjugate":[54],"gradient":[55],"and":[57,106,126,144],"strategies":[58],"to":[59],"produce":[60],"optimal":[62],"primal":[63],"integer":[64],"solution.":[65],"combination":[67],"these":[69],"ingredients":[70],"results":[71,131],"in":[72,87],"code":[74,104,108],"can":[76],"solve":[77],"problems":[82],"having":[83],"over":[84],"250,000":[85],"vertices":[86],"few":[89],"hours":[90],"running":[92,138],"time":[93],"on":[94,110],"workstation-class":[96],"computer.":[97],"compare":[99],"dlnet":[100,134],"with":[101],"simplex":[103],"netflo":[105,143],"relaxation":[107],"relaxt-3":[109],"extensive":[112],"range":[113],"problems,":[119],"including":[120],"circulation,":[123],"maximum":[124],"transshipment":[127],"computational":[130],"show":[132],"offers":[135],"more":[136],"predictable":[137],"times":[139],"than":[140],"those":[141],"relaxt-3.":[145],"Its":[146],"performance,...":[147]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}
