{"id":"https://openalex.org/W2168230055","doi":"https://doi.org/10.1002/net.3230220306","title":"On a parametric shortest path problem from primal\u2014dual multicommodity network optimization","display_name":"On a parametric shortest path problem from primal\u2014dual multicommodity network optimization","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W2168230055","doi":"https://doi.org/10.1002/net.3230220306","mag":"2168230055"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220306","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","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/A5110153713","display_name":"George G. Polak","orcid":null},"institutions":[{"id":"https://openalex.org/I19648265","display_name":"Wright State University","ror":"https://ror.org/04qk6pt94","country_code":"US","type":"education","lineage":["https://openalex.org/I19648265"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George G. Polak","raw_affiliation_strings":["Department of Management Science and Information Systems Wright State University Dayton, Ohio 45435"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Science and Information Systems Wright State University Dayton, Ohio 45435","institution_ids":["https://openalex.org/I19648265"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110153713"],"corresponding_institution_ids":["https://openalex.org/I19648265"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.24759663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":"3","first_page":"283","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.7975914478302002},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7883590459823608},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6665503978729248},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6544796824455261},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6304254531860352},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.540298581123352},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5251573920249939},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4919852912425995},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4836922287940979},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.45866528153419495},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4452480375766754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3125964403152466},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2110712230205536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07178068161010742}],"concepts":[{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.7975914478302002},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7883590459823608},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6665503978729248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6544796824455261},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6304254531860352},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.540298581123352},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5251573920249939},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4919852912425995},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4836922287940979},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.45866528153419495},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4452480375766754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3125964403152466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2110712230205536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07178068161010742},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220306","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W640618376","https://openalex.org/W1124578801","https://openalex.org/W1484040084","https://openalex.org/W1513400187","https://openalex.org/W1551635709","https://openalex.org/W1561880747","https://openalex.org/W1964119857","https://openalex.org/W1969625919","https://openalex.org/W1975787267","https://openalex.org/W1986819665","https://openalex.org/W1995040662","https://openalex.org/W2009927490","https://openalex.org/W2016168355","https://openalex.org/W2027029507","https://openalex.org/W2053913299","https://openalex.org/W2057718356","https://openalex.org/W2063317370","https://openalex.org/W2102035181","https://openalex.org/W2125690626","https://openalex.org/W2135986386","https://openalex.org/W2139605480","https://openalex.org/W2726448539","https://openalex.org/W4231610975","https://openalex.org/W4241113630","https://openalex.org/W4242600577","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2388410942"],"abstract_inverted_index":{"Abstract":[0],"Each":[1],"iteration":[2],"of":[3,53],"the":[4,14,41,51],"primal\u2014dual":[5],"linear":[6],"programming":[7],"algorithm":[8],"entails":[9],"a":[10,27,30],"dual":[11],"update.":[12],"For":[13],"maximal":[15],"multicommodity":[16,21],"flow":[17],"problem,":[18],"and":[19],"for":[20],"network":[22],"synthesis,":[23],"that":[24],"requires":[25],"finding":[26],"breakpoint":[28],"in":[29,47,50],"parametric":[31],"all":[32],"pairs'":[33],"shortest":[34],"path":[35],"problem.":[36],"A":[37],"procedure":[38],"based":[39],"on":[40],"Floyd\u2014Warshall":[42],"Algorithm":[43],"solves":[44],"this":[45],"problem":[46],"polynomial":[48],"(cubic":[49],"number":[52],"nodes)":[54],"time.":[55]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}