{"id":"https://openalex.org/W2150949040","doi":"https://doi.org/10.1109/cdc.2003.1272423","title":"MILP formulation and polynomial time algorithm for an aircraft scheduling problem","display_name":"MILP formulation and polynomial time algorithm for an aircraft scheduling problem","publication_year":2004,"publication_date":"2004-06-21","ids":{"openalex":"https://openalex.org/W2150949040","doi":"https://doi.org/10.1109/cdc.2003.1272423","mag":"2150949040"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1272423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5021116704","display_name":"Alexandre M. Bayen","orcid":"https://orcid.org/0000-0002-6697-222X"},"institutions":[{"id":"https://openalex.org/I13805885","display_name":"Vaughn College of Aeronautics and Technology","ror":"https://ror.org/056e22e24","country_code":"US","type":"education","lineage":["https://openalex.org/I13805885"]},{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.M. Bayen","raw_affiliation_strings":["Department of Aeronautics & Astronautics, University of Stanford, Stanford, CA, USA","Stanford University, Stanford, CA, US"],"affiliations":[{"raw_affiliation_string":"Department of Aeronautics & Astronautics, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I13805885"]},{"raw_affiliation_string":"Stanford University, Stanford, CA, US","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045155646","display_name":"Claire J. Tomlin","orcid":"https://orcid.org/0000-0003-3192-3185"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C.J. Tomlin","raw_affiliation_strings":["Dept. of Aeronaut. & Astronaut., Stanford Univ., CA, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Aeronaut. & Astronaut., Stanford Univ., CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041526408","display_name":"Yinyu Ye","orcid":"https://orcid.org/0009-0001-3239-2622"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"None Yinyu Ye","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100462851","display_name":"Jiawei Zhang","orcid":"https://orcid.org/0000-0003-1377-7938"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"None Jiawei Zhang","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.992,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":34,"citation_normalized_percentile":{"value":0.942898,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":91},"biblio":{"volume":null,"issue":null,"first_page":"5003","last_page":"5010"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11489","display_name":"Air Traffic Management and Optimization","score":0.9998,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9915,"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.979,"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/processor-scheduling","display_name":"Processor scheduling","score":0.4564985}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.61899704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5882369},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.52712965},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.50670606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48719496},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4564985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41699743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24368271},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.058894962},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1272423","pdf_url":null,"source":null,"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/W1567931806","https://openalex.org/W1578129040","https://openalex.org/W1762430620","https://openalex.org/W1964166152","https://openalex.org/W1977545325","https://openalex.org/W2006455928","https://openalex.org/W2011039300","https://openalex.org/W2018130631","https://openalex.org/W2044877165","https://openalex.org/W2060894071","https://openalex.org/W2097731353","https://openalex.org/W2102488278","https://openalex.org/W2112620165","https://openalex.org/W2120471510","https://openalex.org/W2166731466","https://openalex.org/W2304857157","https://openalex.org/W2786741601","https://openalex.org/W4213060235","https://openalex.org/W4249318479"],"related_works":["https://openalex.org/W2546696010","https://openalex.org/W2105304368","https://openalex.org/W2081908687","https://openalex.org/W1993080431","https://openalex.org/W1572330396","https://openalex.org/W1569426892","https://openalex.org/W1564956001","https://openalex.org/W1559428794","https://openalex.org/W1552313225","https://openalex.org/W1527830507"],"abstract_inverted_index":{"This":[0,58],"paper":[1],"presents":[2],"a":[3,10,18,77,131,142,206],"polynomial":[4,148],"time":[5,112,190,237],"algorithm":[6,126,153,172,223],"used":[7],"for":[8,54,173],"solving":[9],"mixed":[11],"integer":[12],"linear":[13],"program":[14],"(MILP)":[15],"formulation":[16],"of":[17,46,80,88,104,107,150,159,168,186,191,209,221,238],"scheduling":[19,52,134],"problem":[20,129],"applicable":[21],"to":[22,35,38,50,130,178,226,229],"air":[23,40,82],"traffic":[24,41,83],"control.":[25],"We":[26,74,145,163,216],"first":[27],"relate":[28],"the":[29,39,71,109,128,147,151,165,187,232],"general":[30],"MILP":[31,59],"(which":[32],"we":[33],"believe":[34],"be":[36,61,95],"NP-hard)":[37],"control":[42,84],"problem,":[43,85,135],"which":[44,86],"consists":[45,106],"performing":[47],"maneuver":[48],"assignments":[49],"achieve":[51],"constraints":[53],"airport":[55],"arrival":[56],"traffic.":[57],"can":[60],"solved":[62,96],"with":[63,119,176,196,211,224],"CPLEX,":[64],"yet":[65],"there":[66],"is":[67,87,201],"no":[68],"guarantee":[69],"on":[70],"running":[72,166,189,236],"time.":[73,215],"show":[75,183],"that":[76],"specific":[78],"case":[79,103,235],"this":[81],"interest":[89,105],"in":[90],"its":[91,139,160],"own":[92],"right,":[93],"may":[94],"using":[97],"an":[98,156],"exact":[99],"polynomial-time":[100],"algorithm.":[101,144,240],"The":[102,181],"finding":[108],"largest":[110],"achievable":[111],"separation":[113],"between":[114],"aircraft":[115,123],"upon":[116],"arrival,":[117],"compatible":[118],"airspace":[120],"restrictions":[121],"and":[122,136,170],"performance.":[124],"Our":[125],"transforms":[127],"single":[132],"machine":[133],"then":[137],"embeds":[138],"solution":[140],"into":[141],"bisection":[143],"establish":[146],"complexity":[149],"resulting":[152],"by":[154,194],"proving":[155],"algebraic":[157],"property":[158],"optimal":[161],"solution.":[162],"compare":[164],"times":[167],"CPLEX":[169,197],"our":[171,192,222,239],"1800":[174],"cases":[175],"up":[177,225],"20":[179],"aircraft.":[180],"results":[182],"numerical":[184],"evidence":[185],"guaranteed":[188],"algorithm,":[193],"contrast":[195],"whose":[198],"average":[199],"performance":[200],"good,":[202],"but":[203],"also":[204],"shows":[205],"significant":[207],"number":[208],"instances":[210],"unpredictably":[212],"large":[213],"computational":[214],"perform":[217],"8100":[218],"additional":[219],"runs":[220],"100":[227],"aircraft,":[228],"numerically":[230],"confirm":[231],"predicted":[233],"worst":[234]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2150949040","counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-01-18T13:09:29.013513","created_date":"2016-06-24"}