{"id":"https://openalex.org/W2105203643","doi":null,"title":"Dynamic Programming: Salesman to Surgeon","display_name":"Dynamic Programming: Salesman to Surgeon","publication_year":2013,"publication_date":"2013-05-15","ids":{"openalex":"https://openalex.org/W2105203643","mag":"2105203643"},"language":"en","primary_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/7526","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/7526","pdf_url":"http://hdl.handle.net/10012/7526","source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10012/7526","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"David Qian","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Qian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9229000210762024,"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.9229000210762024,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07500000298023224,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9990000128746033},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8479999899864197},{"id":"https://openalex.org/keywords/branch-and-price-and-cut","display_name":"branch-price-and-cut","score":0.9520000219345093},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.9139999747276306},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.8600000143051147},{"id":"https://openalex.org/keywords/approximate-linear-programming","display_name":"approximate linear programming","score":0.8399999737739563},{"id":"https://openalex.org/keywords/cranial-vault-remodeling","display_name":"cranial vault remodeling","score":0.9020000100135803},{"id":"https://openalex.org/keywords/skull-surgery","display_name":"skull surgery","score":0.7350000143051147},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9309999942779541}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9192203283309937},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6301525235176086},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6234678030014038},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5983179211616516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5749390721321106},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5704652070999146},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4509531855583191},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4425026476383209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43282294273376465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4261954426765442},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.41958802938461304},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.37339797616004944},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21040546894073486},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/7526","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/7526","pdf_url":"http://hdl.handle.net/10012/7526","source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.863.1424","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.863.1424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://uwspace.uwaterloo.ca/bitstream/handle/10012/7526/Qian_David.pdf%3Bjsessionid%3D33D8D164AAEE4E0285D7F9F5054A0ED9?sequence%3D1","raw_type":"text"},{"id":"mag:2105203643","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/bitstream/10012/7526/1/Qian_David.pdf","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":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/7526","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/7526","pdf_url":"http://hdl.handle.net/10012/7526","source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2105203643.pdf","grobid_xml":"https://content.openalex.org/works/W2105203643.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1520007244","https://openalex.org/W1523938686","https://openalex.org/W1965032790","https://openalex.org/W1970355999","https://openalex.org/W1971483538","https://openalex.org/W2009803313","https://openalex.org/W2020882221","https://openalex.org/W2021659530","https://openalex.org/W2038458261","https://openalex.org/W2058937865","https://openalex.org/W2059816321","https://openalex.org/W2069181244","https://openalex.org/W2074231493","https://openalex.org/W2087260200","https://openalex.org/W2096796578","https://openalex.org/W2108350607","https://openalex.org/W2123701486","https://openalex.org/W2129480990","https://openalex.org/W2135986386","https://openalex.org/W2163873159","https://openalex.org/W2183097989","https://openalex.org/W2312547931","https://openalex.org/W2336259629","https://openalex.org/W2340006107","https://openalex.org/W2340149117","https://openalex.org/W2341171179"],"related_works":["https://openalex.org/W7126314376","https://openalex.org/W2146843586","https://openalex.org/W2522671694","https://openalex.org/W2160004927","https://openalex.org/W2144931885","https://openalex.org/W7117995952","https://openalex.org/W4407572390","https://openalex.org/W6885145744","https://openalex.org/W7098921367","https://openalex.org/W4391477062"],"abstract_inverted_index":{"Dynamic":[0],"Programming":[1],"is":[2,63,104,125],"an":[3],"optimization":[4,24,58],"technique":[5],"used":[6,131],"in":[7,13],"computer":[8],"science":[9],"and":[10,35,82],"mathematics.":[11],"Introduced":[12],"the":[14,28,32,36,69,77,94,110,120,134],"1950s,":[15],"it":[16],"has":[17],"been":[18],"applied":[19],"to":[20,57,67,132],"many":[21],"classic":[22],"combinatorial":[23],"problems,":[25],"such":[26],"as":[27,64,107,109],"Shortest":[29],"Path":[30],"Problem,":[31,34,39],"Knapsack":[33],"Traveling":[37,78],"Salesman":[38,79],"with":[40],"varying":[41],"degrees":[42],"of":[43,54,73,100,116,136,142],"practical":[44],"success.":[45],"\\n":[46],"\\nIn":[47],"this":[48],"thesis,":[49],"we":[50],"present":[51],"two":[52],"applications":[53],"dynamic":[55,128],"programming":[56,129],"problems.":[59],"The":[60,122],"first":[61],"application":[62,124],"a":[65,98,126,139],"method":[66],"compute":[68],"Branch-Cut-and-Price":[70],"(BCP)":[71],"family":[72,96,115],"lower":[74,101,117],"bounds":[75,102,118],"for":[76,119,138],"Problem":[80],"(TSP),":[81],"several":[83],"vehicle":[84],"routing":[85],"problems":[86],"that":[87,93,103],"generalize":[88],"it.":[89],"We":[90],"then":[91],"prove":[92],"BCP":[95],"provides":[97],"set":[99],"at":[105],"least":[106],"strong":[108],"Approximate":[111],"Linear":[112],"Program":[113],"(ALP)":[114],"TSP.":[121],"second":[123],"novel":[127],"model":[130],"determine":[133],"placement":[135],"cuts":[137],"particular":[140],"form":[141],"skull":[143],"surgery":[144],"called":[145],"Cranial":[146],"Vault":[147],"Remodeling.":[148]},"counts_by_year":[],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}