{"id":"https://openalex.org/W2129480990","doi":"https://doi.org/10.1007/s10107-013-0631-6","title":"Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem","display_name":"Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem","publication_year":2013,"publication_date":"2013-01-18","ids":{"openalex":"https://openalex.org/W2129480990","doi":"https://doi.org/10.1007/s10107-013-0631-6","mag":"2129480990"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-013-0631-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-013-0631-6","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5081530725","display_name":"Alejandro Toriello","orcid":"https://orcid.org/0000-0002-3147-0764"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alejandro Toriello","raw_affiliation_strings":["Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, 3715 McClintock Avenue GER 240, Los Angeles, CA, 90089, USA","Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, USA 90089#TAB#"],"affiliations":[{"raw_affiliation_string":"Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, 3715 McClintock Avenue GER 240, Los Angeles, CA, 90089, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, USA 90089#TAB#","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081530725"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.8867,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.94639206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"144","issue":"1-2","first_page":"247","last_page":"264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.9983999729156494,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.904374897480011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7481253743171692},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6515337228775024},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6277580261230469},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6030927300453186},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5783140063285828},{"id":"https://openalex.org/keywords/toll","display_name":"Toll","score":0.5172803401947021},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.514798104763031},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48371604084968567},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.4779758155345917},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47067174315452576},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46947181224823},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4505149722099304},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41627609729766846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19815492630004883}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.904374897480011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7481253743171692},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6515337228775024},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6277580261230469},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6030927300453186},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5783140063285828},{"id":"https://openalex.org/C2778025104","wikidata":"https://www.wikidata.org/wiki/Q408004","display_name":"Toll","level":2,"score":0.5172803401947021},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.514798104763031},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48371604084968567},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.4779758155345917},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47067174315452576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46947181224823},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4505149722099304},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41627609729766846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19815492630004883},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-013-0631-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-013-0631-6","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.6048","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.6048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2011/10/3218.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W77772846","https://openalex.org/W575411337","https://openalex.org/W626292722","https://openalex.org/W1480355964","https://openalex.org/W1489954660","https://openalex.org/W1511451563","https://openalex.org/W1534079060","https://openalex.org/W1571087346","https://openalex.org/W1714357736","https://openalex.org/W1745373831","https://openalex.org/W1877952604","https://openalex.org/W1968492936","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1981245140","https://openalex.org/W2009803313","https://openalex.org/W2017893044","https://openalex.org/W2021659530","https://openalex.org/W2035610952","https://openalex.org/W2036948347","https://openalex.org/W2037448290","https://openalex.org/W2038458261","https://openalex.org/W2038970683","https://openalex.org/W2040766536","https://openalex.org/W2048765511","https://openalex.org/W2058748455","https://openalex.org/W2059128707","https://openalex.org/W2063836932","https://openalex.org/W2081444009","https://openalex.org/W2091565303","https://openalex.org/W2092881721","https://openalex.org/W2107547393","https://openalex.org/W2109405343","https://openalex.org/W2119233436","https://openalex.org/W2125297716","https://openalex.org/W2147783939","https://openalex.org/W2154706439","https://openalex.org/W2163873159","https://openalex.org/W2170412087","https://openalex.org/W2970419211","https://openalex.org/W2988480584","https://openalex.org/W6633936085"],"related_works":["https://openalex.org/W58208513","https://openalex.org/W3162425430","https://openalex.org/W2019808372","https://openalex.org/W2004980487","https://openalex.org/W2045837509","https://openalex.org/W4235176699","https://openalex.org/W4283452420","https://openalex.org/W2038458261","https://openalex.org/W2080382513","https://openalex.org/W2129480990"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}