{"id":"https://openalex.org/W2062014422","doi":"https://doi.org/10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h","title":"State space partitioning methods for stochastic shortest path problems","display_name":"State space partitioning methods for stochastic shortest path problems","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2062014422","doi":"https://doi.org/10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h","mag":"2062014422"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h","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/A5111965782","display_name":"Christos Alexopoulos","orcid":"https://orcid.org/0000-0002-4584-2020"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christos Alexopoulos","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111965782"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.7862,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.73692693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"30","issue":"1","first_page":"9","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9592000246047974,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9451000094413757,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7685744762420654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5683547258377075},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5452308654785156},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5347149968147278},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.461215615272522},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.44863057136535645},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44436392188072205},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43553879857063293},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42248275876045227},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.42170578241348267},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39502227306365967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.394950270652771},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24743756651878357},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21399489045143127},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09207049012184143},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08052733540534973}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7685744762420654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5683547258377075},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5452308654785156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5347149968147278},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.461215615272522},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.44863057136535645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44436392188072205},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43553879857063293},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42248275876045227},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.42170578241348267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39502227306365967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.394950270652771},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24743756651878357},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21399489045143127},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09207049012184143},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08052733540534973},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"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/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2171039275","https://openalex.org/W2388410942"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"methods":[3,46],"for":[4,80,94],"computing":[5],"measures":[6,19],"related":[7],"to":[8,70,109,127,134],"shortest":[9],"paths":[10],"in":[11,113],"networks":[12,129],"with":[13,28],"discrete":[14],"random":[15],"arc":[16],"lengths.":[17],"These":[18,74],"include":[20],"the":[21,36,54,71,90],"probability":[22,37],"that":[23,38,61,130],"there":[24],"exists":[25],"a":[26,32,39],"path":[27,41],"length":[29],"not":[30],"exceeding":[31],"specified":[33],"value":[34],"and":[35,58,66],"given":[40],"is":[42],"shortest.":[43],"The":[44,103],"proposed":[45,91],"are":[47,100],"based":[48],"on":[49],"an":[50],"iterative":[51],"partition":[52],"of":[53],"network":[55],"state":[56],"space":[57],"provide":[59],"bounds":[60,75],"improve":[62],"after":[63],"each":[64],"iteration":[65],"eventually":[67],"become":[68],"equal":[69],"respective":[72],"measure.":[73],"can":[76,105],"also":[77],"be":[78,106],"used":[79],"constructing":[81],"simple":[82],"variance":[83],"reducing":[84],"Monte":[85],"Carlo":[86],"sampling":[87],"plans,":[88],"making":[89],"algorithms":[92,104],"useful":[93],"large":[95],"problems":[96],"where":[97],"exact":[98],"evaluations":[99],"virtually":[101],"impossible.":[102],"easily":[107],"modified":[108],"compute":[110],"performance":[111],"characteristics":[112],"stochastic":[114],"activity":[115],"networks.":[116],"Computational":[117],"experience":[118],"has":[119],"been":[120,125],"encouraging":[121],"as":[122],"we":[123],"have":[124,131],"able":[126],"solve":[128],"presented":[132],"difficulties":[133],"existing":[135],"methods.":[136],"\u00a9":[137],"1997":[138,146],"John":[139],"Wiley":[140],"&":[141],"Sons,":[142],"Inc.":[143],"Networks":[144],"30:9\u201321,":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}