{"id":"https://openalex.org/W1481024874","doi":null,"title":"BOUNDING THE SOLUTION OF THE CONTINUOUS EQUILIBRIUM NETWORK DESIGN PROBLEM","display_name":"BOUNDING THE SOLUTION OF THE CONTINUOUS EQUILIBRIUM NETWORK DESIGN PROBLEM","publication_year":1984,"publication_date":"1984-01-01","ids":{"openalex":"https://openalex.org/W1481024874","mag":"1481024874"},"language":"en","primary_location":{"id":"mag:1481024874","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/263462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5019512091","display_name":"Patrick T. Harker","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrick T. Harker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058356904","display_name":"Terry L. Friesz","orcid":"https://orcid.org/0000-0003-2847-6708","observed_orcids":["https://orcid.org/0000-0003-2847-6708","https://orcid.org/0000-0003-0301-5059"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Terry L. Friesz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2847-6708","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.8506,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9845798,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9839000105857849,"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.9839000105857849,"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/T10524","display_name":"Traffic control and management","score":0.004600000102072954,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11031","display_name":"Game Theory and Applications","score":0.002099999925121665,"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/boundedness-of-solutions","display_name":"boundedness of solutions","score":0.656000018119812},{"id":"https://openalex.org/keywords/game-theoretic-analysis","display_name":"game-theoretic analysis","score":0.6660000085830688},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.7940000295639038},{"id":"https://openalex.org/keywords/transportation-network-analysis","display_name":"transportation network analysis","score":0.7940000295639038}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8015549182891846},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6833187341690063},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6667824387550354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5227047204971313},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.43920066952705383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30910438299179077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0888693630695343}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1481024874","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/263462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2058405995","https://openalex.org/W575472612","https://openalex.org/W4248404398","https://openalex.org/W7171693752","https://openalex.org/W754018250","https://openalex.org/W2802087354","https://openalex.org/W2078524469","https://openalex.org/W2028614013","https://openalex.org/W2499722591","https://openalex.org/W594112534"],"abstract_inverted_index":{"The":[0],"solution":[1,35,69],"of":[2,27,36,40],"the":[3,11,25,34,37,67],"optimal":[4],"equilibrium":[5],"network":[6,19],"design":[7],"problem":[8,15,42],"is":[9,62,76],"perhaps":[10],"most":[12],"computationally":[13,46],"intensive":[14],"encountered":[16],"in":[17],"transportation":[18],"analysis.":[20],"This":[21,49],"paper":[22],"illustrates":[23,79],"through":[24],"use":[26],"game-theoretic":[28],"concepts":[29],"how":[30],"one":[31],"can":[32,52],"bound":[33],"continuous":[38],"version":[39],"this":[41,71,80],"by":[43],"using":[44],"two":[45],"efficient":[47],"heuristics.":[48],"bounding":[50],"procedure":[51],"then":[53],"be":[54],"used":[55],"to":[56,64,70],"assess":[57],"whether":[58],"or":[59],"not":[60],"it":[61],"necessary":[63],"solve":[65],"for":[66],"exact":[68],"problem.":[72],"A":[73],"numerical":[74],"example":[75],"presented":[77],"which":[78],"procedure.":[81],"(Author/TRRL)":[82]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}