{"id":"https://openalex.org/W2317616272","doi":"https://doi.org/10.1109/codit.2014.6996883","title":"Polyhedral study for the maximum bounded r-tree problem","display_name":"Polyhedral study for the maximum bounded r-tree problem","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2317616272","doi":"https://doi.org/10.1109/codit.2014.6996883","mag":"2317616272"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2014.6996883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-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/A5076606943","display_name":"Herv\u00e9 Kerivin","orcid":"https://orcid.org/0000-0002-1694-7640"},"institutions":[{"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/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","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":"Herve Kerivin","raw_affiliation_strings":["LIMOS - UMR 6158 CNRS, Aubi\u00e8re, CEDEX, France"],"affiliations":[{"raw_affiliation_string":"LIMOS - UMR 6158 CNRS, Aubi\u00e8re, CEDEX, France","institution_ids":["https://openalex.org/I4210099416","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023530848","display_name":"Jinhua Zhao","orcid":"https://orcid.org/0000-0003-4290-6540"},"institutions":[{"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/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jinhua Zhao","raw_affiliation_strings":["Laboratoire d'Informatique de Modelisation et d'Optimisation des Systemes, Aubiere, Auvergne-Rh\u00c3\u00b4ne-Alpes, FR","Laboratoire d'Informatique de Modelisation et d'Optimisation des Systemes, Aubiere, Auvergne-Rh\u00f4ne-Alpes, FR"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique de Modelisation et d'Optimisation des Systemes, Aubiere, Auvergne-Rh\u00c3\u00b4ne-Alpes, FR","institution_ids":["https://openalex.org/I4210099416"]},{"raw_affiliation_string":"Laboratoire d'Informatique de Modelisation et d'Optimisation des Systemes, Aubiere, Auvergne-Rh\u00f4ne-Alpes, FR","institution_ids":["https://openalex.org/I4210099416"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076606943"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210099416"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20148041,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9987999796867371,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9919000267982483,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7595636248588562},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7186753749847412},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6414873003959656},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5654295086860657},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.533616304397583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5010993480682373},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4779548645019531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44614049792289734},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.42393773794174194},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41629648208618164},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3997651934623718}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7595636248588562},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7186753749847412},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6414873003959656},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5654295086860657},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.533616304397583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5010993480682373},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4779548645019531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44614049792289734},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.42393773794174194},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41629648208618164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3997651934623718},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2014.6996883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1774950136","https://openalex.org/W1999578543","https://openalex.org/W2012329067","https://openalex.org/W2055505431","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W1493684871","https://openalex.org/W2886567582","https://openalex.org/W4390962314","https://openalex.org/W4289703404","https://openalex.org/W2999175164","https://openalex.org/W4387265813","https://openalex.org/W4286224459","https://openalex.org/W4320410061","https://openalex.org/W1985727224"],"abstract_inverted_index":{"Given":[0],"an":[1],"undirected":[2],"graph":[3],"G,":[4],"a":[5,22],"specific":[6],"node":[7,39],"r,":[8],"and":[9,98,106],"capacity":[10],"on":[11,96],"the":[12,14,38,50,60,64,83,92],"nodes,":[13],"maximum":[15],"bounded":[16],"r-tree":[17],"problem":[18,44],"consists":[19],"of":[20,24,52,66,73,82,91],"finding":[21],"tree":[23],"G":[25],"rooted":[26],"at":[27],"r":[28],"containing":[29],"as":[30,33,85,87],"many":[31],"nodes":[32],"possible":[34],"with":[35],"respect":[36],"to":[37,78],"capacities.":[40],"This":[41],"NP-hard":[42],"optimization":[43],"has":[45],"been":[46],"recently":[47],"considered":[48],"in":[49,63],"context":[51],"peer-to-peer":[53],"networks.":[54],"In":[55],"this":[56],"work,":[57],"we":[58],"study":[59],"associated":[61],"polytope,":[62],"space":[65],"edge":[67],"variables.":[68],"We":[69,100],"introduce":[70],"several":[71],"families":[72],"facet-defining":[74],"inequalities":[75],"which":[76],"lead":[77],"complete":[79],"polyhedral":[80],"descriptions":[81],"polytope":[84],"well":[86],"total":[88],"dual":[89],"integrality":[90],"defining":[93],"linear":[94],"system":[95],"trees":[97],"cycles.":[99],"also":[101],"address":[102],"their":[103],"separation":[104],"problems":[105],"present":[107],"some":[108],"preliminary":[109],"computational":[110],"results":[111],"obtained":[112],"by":[113],"our":[114],"branch-and-cut":[115],"algorithm.":[116]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}