乐胖代购免代理版

{"id":"https://openalex.org/W2129103259","doi":"https://doi.org/10.1051/ro/2014008","title":"Integer programming approaches for minimum stabbing problems","display_name":"Integer programming approaches for minimum stabbing problems","publication_year":2014,"publication_date":"2014-03-07","ids":{"openalex":"https://openalex.org/W2129103259","doi":"https://doi.org/10.1051/ro/2014008","mag":"2129103259"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2014008","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"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":true,"oa_status":"green","oa_url":"http://www.numdam.org/item/10.1051/ro/2014008.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091787470","display_name":"Breno Piva","orcid":"https://orcid.org/0000-0002-2042-4623"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"funder","lineage":["https://openalex.org/I181391015"]},{"id":"https://openalex.org/I190085865","display_name":"Universidade Federal de Sergipe","ror":"https://ror.org/028ka0n85","country_code":"BR","type":"funder","lineage":["https://openalex.org/I190085865"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Breno Piva","raw_affiliation_strings":["Universidade Estadual de Campinas, Instituto de Computa\u00e7\u00e3o, Av. Albert Einstein 1251, 13083-852 Campinas (SP), Brazil.","Universidade Federal de Sergipe, Departamento de Computa\u00e7\u00e3o, Cidade Universit\u00e1ria Prof. Alo\u00edsio Campos, 49100-000 S\u00e3o Crist\u00f3v\u00e3o (SE), Brazil."],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas, Instituto de Computa\u00e7\u00e3o, Av. Albert Einstein 1251, 13083-852 Campinas (SP), Brazil.","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"Universidade Federal de Sergipe, Departamento de Computa\u00e7\u00e3o, Cidade Universit\u00e1ria Prof. Alo\u00edsio Campos, 49100-000 S\u00e3o Crist\u00f3v\u00e3o (SE), Brazil.","institution_ids":["https://openalex.org/I190085865"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005416520","display_name":"Cid C. de Souza","orcid":"https://orcid.org/0000-0002-5945-0845"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"funder","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Cid C. de Souza","raw_affiliation_strings":["Universidade Estadual de Campinas, Instituto de Computa\u00e7\u00e3o, Av. Albert Einstein 1251, 13083-852 Campinas (SP), Brazil."],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas, Instituto de Computa\u00e7\u00e3o, Av. Albert Einstein 1251, 13083-852 Campinas (SP), Brazil.","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013207221","display_name":"Yuri Frota","orcid":"https://orcid.org/0000-0002-3434-3074"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"funder","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Yuri Frota","raw_affiliation_strings":["Universidade Federal Fluminense, Instituto de Computa\u00e7\u00e3o, R. Passo da P\u00e1tria 156, Bloco E, 24210-240 Niter\u00f3i (RJ), Brazil."],"affiliations":[{"raw_affiliation_string":"Universidade Federal Fluminense, Instituto de Computa\u00e7\u00e3o, R. Passo da P\u00e1tria 156, Bloco E, 24210-240 Niter\u00f3i (RJ), Brazil.","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091887801","display_name":"Luidi Simonetti","orcid":"https://orcid.org/0000-0001-8273-9439"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"funder","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luidi Simonetti","raw_affiliation_strings":["Universidade Federal Fluminense, Instituto de Computa\u00e7\u00e3o, R. Passo da P\u00e1tria 156, Bloco E, 24210-240 Niter\u00f3i (RJ), Brazil."],"affiliations":[{"raw_affiliation_string":"Universidade Federal Fluminense, Instituto de Computa\u00e7\u00e3o, R. Passo da P\u00e1tria 156, Bloco E, 24210-240 Niter\u00f3i (RJ), Brazil.","institution_ids":["https://openalex.org/I161127581"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.285,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.382484,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":66,"max":73},"biblio":{"volume":"48","issue":"2","first_page":"211","last_page":"233"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9989,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8305196},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.52678144},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4692977},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.42658356}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8305196},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6785419},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.56634367},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.52678144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47846222},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.47316533},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4692977},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4677534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4629802},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45549875},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.42658356},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.422265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35130453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28977603},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2014008","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2014008/","pdf_url":"http://www.numdam.org/item/10.1051/ro/2014008.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","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/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":["Universit\u00e9 Savoie Mont Blanc"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2014008/","pdf_url":"http://www.numdam.org/item/10.1051/ro/2014008.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","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/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":["Universit\u00e9 Savoie Mont Blanc"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[{"score":0.41,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1558071713","https://openalex.org/W1591764237","https://openalex.org/W1983006110","https://openalex.org/W1994072278","https://openalex.org/W2038344659","https://openalex.org/W2080207623","https://openalex.org/W2086472866","https://openalex.org/W2093890557","https://openalex.org/W2116909526","https://openalex.org/W2123805664","https://openalex.org/W2140596151","https://openalex.org/W2155239253","https://openalex.org/W2164424155","https://openalex.org/W2311958504","https://openalex.org/W2327315803","https://openalex.org/W26531692","https://openalex.org/W3137400503","https://openalex.org/W4292912125"],"related_works":["https://openalex.org/W2354460058","https://openalex.org/W2275468419","https://openalex.org/W2084616826","https://openalex.org/W2080154522","https://openalex.org/W2012183228","https://openalex.org/W2009796757","https://openalex.org/W2008600006","https://openalex.org/W1971357083","https://openalex.org/W1968202374","https://openalex.org/W1595394363"],"abstract_inverted_index":{"The":[0,40,123],"problem":[1],"of":[2,22,35,42,92,108,116,144],"finding":[3],"structures":[4],"with":[5,99,114,132,141],"minimum":[6,19],"stabbing":[7,20,165],"number":[8,21],"has":[9],"received":[10],"considerable":[11],"attention":[12],"from":[13,102],"researchers.":[14],"Particularly,":[15],"[10]":[16],"study":[17,158],"the":[18,38,43,48,87,90,103,106,109,117,127,155],"perfect":[23],"matchings":[24],"(mspm),":[25],"spanning":[26],"trees":[27],"(msst)":[28],"and":[29,120,134,169],"triangulations":[30],"(mstr)":[31],"associated":[32],"to":[33,53,70,73],"set":[34],"points":[36,145],"in":[37,146,161],"plane.":[39],"complexity":[41],"mstr":[44],"remains":[45],"open":[46],"whilst":[47],"other":[49],"two":[50],"are":[51,86,167,174],"known":[52],"be":[54],"\ud835\udcdd\ud835\udcdf-hard.":[55],"This":[56],"paper":[57],"presents":[58],"integer":[59],"programming":[60],"(ip)":[61],"formulations":[62],"for":[63,89,139],"these":[64,84,163],"three":[65,164],"problems,":[66],"that":[67,115,126],"allowed":[68],"us":[69],"solve":[71],"them":[72],"optimality":[74],"through":[75],"ip":[76],"branch-and-bound":[77],"(b&b)":[78],"or":[79],"branch-and-cut":[80],"(b&c)":[81],"algorithms.":[82,122],"Moreover,":[83],"models":[85],"basis":[88],"development":[91],"Lagrangian":[93,110,128],"heuristics.":[94],"Computational":[95],"tests":[96],"were":[97,112],"conducted":[98],"instances":[100,140],"taken":[101],"literature":[104],"where":[105,170],"performance":[107],"heuristics":[111,129],"compared":[113],"exact":[118],"b&b":[119],"b&c":[121],"results":[124],"reveal":[125],"yield":[130],"solutions":[131,173],"minute,":[133],"often":[135],"null,":[136],"duality":[137],"gaps":[138],"several":[142],"hundreds":[143],"small":[147],"computation":[148],"times.":[149],"To":[150],"our":[151],"knowledge,":[152],"this":[153],"is":[154],"first":[156],"computational":[157],"ever":[159],"reported":[160],"which":[162],"problems":[166],"considered":[168],"provably":[171],"optimal":[172],"given.":[175]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2129103259","counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-02-19T03:00:47.270829","created_date":"2016-06-24"}