乐胖代购免代理版

{"id":"https://openalex.org/W2796710024","doi":"https://doi.org/10.1016/j.endm.2018.03.006","title":"A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs","display_name":"A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2796710024","doi":"https://doi.org/10.1016/j.endm.2018.03.006","mag":"2796710024"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.endm.2018.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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/A5063834733","display_name":"Iago A. Carvalho","orcid":"https://orcid.org/0000-0001-9404-1329"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Iago A. Carvalho","raw_affiliation_strings":["Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antnio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antnio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070339603","display_name":"Thiago F. Noronha","orcid":"https://orcid.org/0000-0002-6831-2006"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Thiago F. Noronha","raw_affiliation_strings":["Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antnio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antnio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079313882","display_name":"Christophe Duhamel","orcid":"https://orcid.org/0000-0001-6522-7343"},"institutions":[{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Chistophe Duhamel","raw_affiliation_strings":["Laboratoire LIMOS, CNRS-UMR 6158, Universit\u00e9 Clermont Auvergne, Clermont-Ferrand, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire LIMOS, CNRS-UMR 6158, Universit\u00e9 Clermont Auvergne, Clermont-Ferrand, France","institution_ids":["https://openalex.org/I198244214","https://openalex.org/I1294671590","https://openalex.org/I4210099416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112358776","display_name":"Luiz F.M. Vieira","orcid":null},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Luiz F.M. Vieira","raw_affiliation_strings":["Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antnio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antnio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil","institution_ids":["https://openalex.org/I110200422"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5063834733","https://openalex.org/A5070339603","https://openalex.org/A5079313882","https://openalex.org/A5112358776"],"corresponding_institution_ids":["https://openalex.org/I110200422","https://openalex.org/I110200422","https://openalex.org/I198244214","https://openalex.org/I1294671590","https://openalex.org/I4210099416","https://openalex.org/I110200422"],"apc_list":null,"apc_paid":null,"fwci":0.658,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"citation_normalized_percentile":{"value":0.644574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":74,"max":77},"biblio":{"volume":"66","issue":null,"first_page":"39","last_page":"46"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9883,"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.9883,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9806,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9695,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.54243726},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.43557137}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6791421},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6633323},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6572542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5976304},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.59046215},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.54243726},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5012016},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47246218},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.43557137},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.41611433},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.41326785},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.24837801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24476615},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.21245664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15222216},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.09702149},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07630578},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.057303905},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"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":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.endm.2018.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-02196337","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":["Centre National de la Recherche Scientifique"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.science/hal-02196337","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":[{"score":0.61,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":8,"referenced_works":["https://openalex.org/W1591370845","https://openalex.org/W2148514396","https://openalex.org/W2325877089","https://openalex.org/W2484016216","https://openalex.org/W2523965822","https://openalex.org/W4285719527","https://openalex.org/W647522939","https://openalex.org/W94730780"],"related_works":["https://openalex.org/W4386259575","https://openalex.org/W3123643494","https://openalex.org/W2983794855","https://openalex.org/W2767202586","https://openalex.org/W2388051136","https://openalex.org/W2370345607","https://openalex.org/W2171039275","https://openalex.org/W2139558309","https://openalex.org/W2019018557","https://openalex.org/W2017694061"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2796710024","counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-01-21T00:53:10.631171","created_date":"2018-04-24"}