乐胖代购免代理版

{"id":"https://openalex.org/W321511787","doi":"https://doi.org/10.1016/j.cor.2015.04.020","title":"Lower bounds and exact algorithms for the quadratic minimum spanning tree problem","display_name":"Lower bounds and exact algorithms for the quadratic minimum spanning tree problem","publication_year":2015,"publication_date":"2015-05-14","ids":{"openalex":"https://openalex.org/W321511787","doi":"https://doi.org/10.1016/j.cor.2015.04.020","mag":"321511787"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2015.04.020","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"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/A5064768482","display_name":"Dilson Lucas Pereira","orcid":"https://orcid.org/0000-0002-6307-5152"},"institutions":[{"id":"https://openalex.org/I4210097716","display_name":"Coordena\u00e7\u00e3o de Aperfeicoamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614","country_code":"BR","type":"government","lineage":["https://openalex.org/I1293487690","https://openalex.org/I2801200668","https://openalex.org/I4210097716"]},{"id":"https://openalex.org/I1293487690","display_name":"Ministry of Education","ror":"https://ror.org/04d0xx942","country_code":"BR","type":"government","lineage":["https://openalex.org/I1293487690","https://openalex.org/I2801200668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Dilson Lucas Pereira","raw_affiliation_strings":["CAPES Foundation; Ministry of Education of Brazil, Bras\u00edlia-DF 70.040-020; Brazil"],"affiliations":[{"raw_affiliation_string":"CAPES Foundation; Ministry of Education of Brazil, Bras\u00edlia-DF 70.040-020; Brazil","institution_ids":["https://openalex.org/I4210097716","https://openalex.org/I1293487690"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034438662","display_name":"Michel Gendreau","orcid":"https://orcid.org/0000-0002-9262-3648"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michel Gendreau","raw_affiliation_strings":["Ecole Polytechnique de Montreal , Montreal , Canada"],"affiliations":[{"raw_affiliation_string":"Ecole Polytechnique de Montreal , Montreal , Canada","institution_ids":["https://openalex.org/I45683168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014333403","display_name":"Alexandre Salles da Cunha","orcid":"https://orcid.org/0000-0002-9955-5721"},"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":false,"raw_author_name":"Alexandre Salles da Cunha","raw_affiliation_strings":["Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil."],"affiliations":[{"raw_affiliation_string":"Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil.","institution_ids":["https://openalex.org/I110200422"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3210,"currency":"USD","value_usd":3210,"provenance":"doaj"},"apc_paid":null,"fwci":3.549,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.928417,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":89},"biblio":{"volume":"63","issue":null,"first_page":"149","last_page":"160"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998,"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.998,"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.9962,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9924,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.60270184},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5396528},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4935881},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4858403},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.47882298},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.44730964},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4266342},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.42227268}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.73551536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.68304586},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6829846},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.60270184},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5396528},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.53961873},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5174171},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.50080585},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4935881},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48970297},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4858403},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.47882298},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44879782},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.44730964},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4266342},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4233039},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.42227268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41841978},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.41192937},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39350837},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2344876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22591174},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21083915},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.08361569},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2015.04.020","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"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}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.66,"display_name":"Life on land"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":27,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1967987311","https://openalex.org/W1971036791","https://openalex.org/W1986330908","https://openalex.org/W1991528957","https://openalex.org/W2003427112","https://openalex.org/W2015718828","https://openalex.org/W2016379692","https://openalex.org/W2017697298","https://openalex.org/W2017927472","https://openalex.org/W2020384435","https://openalex.org/W2042442792","https://openalex.org/W2044707039","https://openalex.org/W2048804785","https://openalex.org/W2049299385","https://openalex.org/W2060514920","https://openalex.org/W2076535438","https://openalex.org/W2078992232","https://openalex.org/W2079583273","https://openalex.org/W2082782506","https://openalex.org/W2084512390","https://openalex.org/W2119799975","https://openalex.org/W2128971018","https://openalex.org/W2327315803","https://openalex.org/W2338192490","https://openalex.org/W2394613579","https://openalex.org/W3131432727"],"related_works":["https://openalex.org/W566167518","https://openalex.org/W4210880521","https://openalex.org/W3126345618","https://openalex.org/W2979455991","https://openalex.org/W2110818895","https://openalex.org/W2109445739","https://openalex.org/W2105006450","https://openalex.org/W2021079478","https://openalex.org/W1531708257","https://openalex.org/W134055995"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W321511787","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2024-12-16T06:45:19.996060","created_date":"2016-06-24"}