{"id":"https://openalex.org/W2170442314","doi":"https://doi.org/10.1287/moor.27.2.312.325","title":"A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems","display_name":"A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W2170442314","doi":"https://doi.org/10.1287/moor.27.2.312.325","mag":"2170442314"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.27.2.312.325","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5049973502","display_name":"Eugene Khmelnitsky","orcid":"https://orcid.org/0000-0002-9084-3487"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Eugene Khmelnitsky","raw_affiliation_strings":["Department of Industrial Engineering, Tel Aviv University, Ramat Aviv 69978, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Tel Aviv University, Ramat Aviv 69978, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049973502"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.957,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":18,"citation_normalized_percentile":{"value":0.919385,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":84,"max":85},"biblio":{"volume":"27","issue":"2","first_page":"312","last_page":"325"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9788,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9783,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/sequence","display_name":"Sequence (biology)","score":0.469287}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6832765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6740737},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6706599},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5754389},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5215121},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.49685815},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4920904},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.48472738},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.469287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.268846},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2640308},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12862751},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.27.2.312.325","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":19,"referenced_works":["https://openalex.org/W1576455434","https://openalex.org/W1587650745","https://openalex.org/W1982019931","https://openalex.org/W1993005215","https://openalex.org/W2014767798","https://openalex.org/W2035542416","https://openalex.org/W204291894","https://openalex.org/W2055822187","https://openalex.org/W2132217990","https://openalex.org/W2133248407","https://openalex.org/W2136357087","https://openalex.org/W2137867542","https://openalex.org/W2318352949","https://openalex.org/W2339133824","https://openalex.org/W2489790720","https://openalex.org/W267034796","https://openalex.org/W2798500587","https://openalex.org/W4234509518","https://openalex.org/W610544597"],"related_works":["https://openalex.org/W4387185483","https://openalex.org/W4385965963","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W2600678155","https://openalex.org/W2388410942","https://openalex.org/W2040572217","https://openalex.org/W2022506245","https://openalex.org/W2018146256"],"abstract_inverted_index":{"The":[0,88],"paper":[1,46],"addresses":[2],"a":[3,63,76,107],"class":[4],"of":[5,27,70],"continuous-time,":[6],"optimal":[7,48],"control":[8,20,41,49,100],"problems":[9,50,97],"whose":[10],"solutions":[11,29],"are":[12,30,43,73,111],"typically":[13],"characterized":[14],"by":[15,51],"both":[16],"bang-bang":[17],"and":[18,24,33,106],"\"singular\"":[19],"regimes.":[21],"Analytical":[22],"study":[23],"numerical":[25],"computation":[26],"such":[28],"very":[31],"difficult":[32],"far":[34],"from":[35,40],"complete":[36],"when":[37],"only":[38],"techniques":[39],"theory":[42],"used.":[44],"This":[45],"solves":[47],"reducing":[52],"them":[53],"to":[54,85,95,114],"the":[55,59,68,71,81,116],"combinatorial":[56],"search":[57],"for":[58],"shortest":[60],"path":[61],"in":[62,75],"specially":[64],"constructed":[65],"graph.":[66],"Since":[67],"nodes":[69],"graph":[72],"weighted":[74],"sequence-dependent":[77],"manner,":[78],"we":[79],"extend":[80],"classical,":[82],"shortest-path":[83],"algorithm":[84],"our":[86],"case.":[87],"proposed":[89],"solution":[90],"method":[91],"is":[92],"currently":[93],"limited":[94],"single-state":[96],"with":[98],"multiple":[99],"functions.":[101],"A":[102],"production":[103],"planning":[104],"problem":[105,110],"train":[108],"operation":[109],"optimally":[112],"solved":[113],"illustrate":[115],"method.":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2170442314","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2024-12-11T14:36:46.371658","created_date":"2016-06-24"}