{"id":"https://openalex.org/W60125814","doi":"https://doi.org/10.1023/a:1009621108971","title":"Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models","display_name":"Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models","publication_year":2000,"publication_date":"2000-05-01","ids":{"openalex":"https://openalex.org/W60125814","doi":"https://doi.org/10.1023/a:1009621108971","mag":"60125814"},"language":"en","primary_location":{"id":"doi:10.1023/a:1009621108971","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009621108971","pdf_url":null,"source":{"id":"https://openalex.org/S47778307","display_name":"Computational and Mathematical Organization Theory","issn_l":"1381-298X","issn":["1381-298X","1572-9346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational & Mathematical Organization Theory","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/A5049092438","display_name":"Steven A. Gabriel","orcid":"https://orcid.org/0000-0002-3946-3139"},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Steven A. Gabriel","raw_affiliation_strings":["The George Washington University and ICF Consulting, Washington, DC, 20052, USA","The George Washington University and ICF Consulting, Washington, DC 20052, USA.sgabriel@seas.gwu.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"The George Washington University and ICF Consulting, Washington, DC, 20052, USA","institution_ids":["https://openalex.org/I193531525"]},{"raw_affiliation_string":"The George Washington University and ICF Consulting, Washington, DC 20052, USA.sgabriel@seas.gwu.edu#TAB#","institution_ids":["https://openalex.org/I193531525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034935385","display_name":"David Bernstein","orcid":"https://orcid.org/0000-0002-2267-5741"},"institutions":[{"id":"https://openalex.org/I11883440","display_name":"James Madison University","ror":"https://ror.org/028pmsz77","country_code":"US","type":"education","lineage":["https://openalex.org/I11883440"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Bernstein","raw_affiliation_strings":["Dept. of Computer Science, James Madison University, Harrisonburg, VA, USA","James Madison University, Dept. of Computer Science, Harrisonburg, VA, USA. bernstdh@jmu.edu"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, James Madison University, Harrisonburg, VA, USA","institution_ids":["https://openalex.org/I11883440"]},{"raw_affiliation_string":"James Madison University, Dept. of Computer Science, Harrisonburg, VA, USA. bernstdh@jmu.edu","institution_ids":["https://openalex.org/I11883440"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049092438"],"corresponding_institution_ids":["https://openalex.org/I193531525"],"apc_list":{"value":2090,"currency":"EUR","value_usd":2690},"apc_paid":null,"fwci":2.1718,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.87148103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":"1","first_page":"29","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7201516628265381},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6694443821907043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6524146795272827},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6164752840995789},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.548480749130249},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.5365936756134033},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44147101044654846},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4200698137283325},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.41006308794021606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30706778168678284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23128899931907654},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2071879506111145},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.184632807970047},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09009453654289246}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7201516628265381},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6694443821907043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6524146795272827},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6164752840995789},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.548480749130249},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.5365936756134033},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44147101044654846},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4200698137283325},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.41006308794021606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30706778168678284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23128899931907654},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2071879506111145},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.184632807970047},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09009453654289246},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1023/a:1009621108971","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009621108971","pdf_url":null,"source":{"id":"https://openalex.org/S47778307","display_name":"Computational and Mathematical Organization Theory","issn_l":"1381-298X","issn":["1381-298X","1572-9346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational & Mathematical Organization Theory","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:comaot:v:6:y:2000:i:1:d:10.1023_a:1009621108971","is_oa":false,"landing_page_url":"http://link.springer.com/10.1023/A:1009621108971","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309515","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67"},{"id":"https://openalex.org/F4320310145","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W632573917","https://openalex.org/W1845807162","https://openalex.org/W1964443412","https://openalex.org/W1977545325","https://openalex.org/W2053871649","https://openalex.org/W2063549568","https://openalex.org/W2066047491","https://openalex.org/W2066060390","https://openalex.org/W2139211712","https://openalex.org/W2155370486","https://openalex.org/W2336259629","https://openalex.org/W2787523326","https://openalex.org/W4242130683"],"related_works":["https://openalex.org/W2370345607","https://openalex.org/W2388051136","https://openalex.org/W2171039275","https://openalex.org/W2047399896","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W2369626564","https://openalex.org/W2523719706","https://openalex.org/W2198982833","https://openalex.org/W1990043277"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}