乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:33:22Z","timestamp":1740119602781,"version":"3.37.3"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["CEX-PPM-00164\/17"],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303928\/2018-2"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1016\/j.comgeo.2021.101771","type":"journal-article","created":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T15:44:18Z","timestamp":1617378258000},"page":"101771","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms"],"prefix":"10.1016","volume":"97","author":[{"given":"Dilson Almeida","family":"Guimar\u00e3es","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9955-5721","authenticated-orcid":false,"given":"Alexandre","family":"Salles da Cunha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2021.101771_br0010","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s00453-009-9281-8","article-title":"Algorithmic aspects of proportional symbol maps","volume":"58","author":"Cabello","year":"2010","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2021.101771_br0020","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2015.09.001","article-title":"Arc-based integer programming formulations for three variants of proportional symbol maps","volume":"18","author":"Cano","year":"2015","journal-title":"Discrete Optim."},{"issue":"3","key":"10.1016\/j.comgeo.2021.101771_br0030","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.comgeo.2006.03.001","article-title":"The minimum-area spanning tree problem","volume":"35","author":"Carmi","year":"2006","journal-title":"Comput. Geom."},{"author":"Christof","key":"10.1016\/j.comgeo.2021.101771_br0040"},{"key":"10.1016\/j.comgeo.2021.101771_br0050","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","article-title":"On the power assignment problem in radio networks","volume":"9","author":"Clementi","year":"2004","journal-title":"Mob. Netw. Appl."},{"issue":"4","key":"10.1016\/j.comgeo.2021.101771_br0060","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","article-title":"Combinatorial benders' cuts for mixed-integer linear programming","volume":"54","author":"Codato","year":"2006","journal-title":"Oper. Res."},{"issue":"6","key":"10.1016\/j.comgeo.2021.101771_br0070","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","article-title":"A survey on benders decomposition applied to fixed-charge network design problems","volume":"32","author":"Costa","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.comgeo.2021.101771_br0080","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.7.1.58","article-title":"On a linear-programming combinatorial approach to the traveling salesman problem","volume":"7","author":"Dantzig","year":"1959","journal-title":"Oper. Res."},{"key":"10.1016\/j.comgeo.2021.101771_br0090","series-title":"Algorithm Engineering","article-title":"Engineering art galleries","volume":"vol. 9220","author":"de Rezende","year":"2016"},{"issue":"2","key":"10.1016\/j.comgeo.2021.101771_br0100","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmark optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.comgeo.2021.101771_br0110","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","article-title":"Matroids and the greedy algorithm","volume":"1","author":"Edmonds","year":"1971","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.comgeo.2021.101771_br0120","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","article-title":"Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem","volume":"26","author":"Gendron","year":"2014","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.comgeo.2021.101771_br0130","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numer. Math."},{"issue":"10","key":"10.1016\/j.comgeo.2021.101771_br0140","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1007\/s00371-012-0727-7","article-title":"Generating optimal drawings of physically realizable symbol maps with integer programming","volume":"28","author":"Kunigami","year":"2012","journal-title":"Vis. Comput."},{"issue":"3","key":"10.1016\/j.comgeo.2021.101771_br0150","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","article-title":"Accelerating benders decomposition: algorithmic enhancement and model selection criteria","volume":"29","author":"Magnanti","year":"1981","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.comgeo.2021.101771_br0160","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev."},{"key":"10.1016\/j.comgeo.2021.101771_br0170","series-title":"Combinatorial Mathematics","first-page":"511","article-title":"Trees and cuts","volume":"vol. 75","author":"Padberg","year":"1983"},{"issue":"4","key":"10.1016\/j.comgeo.2021.101771_br0190","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.orl.2008.01.005","article-title":"Practical enhancements to the Magnanti-Wong method","volume":"36","author":"Papadakos","year":"2008","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.comgeo.2021.101771_br0200","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB - a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"author":"The CGAL Project","key":"10.1016\/j.comgeo.2021.101771_br0210"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772121000274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772121000274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T22:19:23Z","timestamp":1678141163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772121000274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":20,"alternative-id":["S0925772121000274"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2021.101771","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2021.101771","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"101771"}}