{"id":"https://openalex.org/W1987970555","doi":"https://doi.org/10.1109/gensips.2013.6735948","title":"Improved branch-and-bound algorithm for U-curve optimization","display_name":"Improved branch-and-bound algorithm for U-curve optimization","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1987970555","doi":"https://doi.org/10.1109/gensips.2013.6735948","mag":"1987970555"},"language":"en","primary_location":{"id":"doi:10.1109/gensips.2013.6735948","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gensips.2013.6735948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Workshop on Genomic Signal Processing and Statistics","raw_type":"proceedings-article"},"type":"conference-paper","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/A5112330665","display_name":"Esmaeil Atashpaz-Gargari","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Esmaeil Atashpaz-Gargari","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Texas A&M University","Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026990034","display_name":"Ulisses Braga-Neto","orcid":"https://orcid.org/0000-0002-1210-2173"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ulisses M. Braga-Neto","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Texas A&M University","Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112221423","display_name":"Edward R. Dougherty","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edward R. Dougherty","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Texas A&M University","Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.07315289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"100","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10531","display_name":"Advanced Vision and Imaging","score":0.973800003528595,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/branch-and-bound","display_name":"Branch and bound","score":0.6641923785209656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6485543847084045},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5233944058418274},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.48381489515304565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47824302315711975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4033825397491455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39249303936958313}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6641923785209656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6485543847084045},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5233944058418274},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.48381489515304565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47824302315711975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4033825397491455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39249303936958313},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/gensips.2013.6735948","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gensips.2013.6735948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Workshop on Genomic Signal Processing and Statistics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2106127648","https://openalex.org/W2148633389","https://openalex.org/W2963572320","https://openalex.org/W6628758090"],"related_works":["https://openalex.org/W4366549320","https://openalex.org/W4287863136","https://openalex.org/W3006015132","https://openalex.org/W2965078190","https://openalex.org/W2209011256","https://openalex.org/W2140656843","https://openalex.org/W3040644038","https://openalex.org/W4394870774","https://openalex.org/W4311207076","https://openalex.org/W3203633096"],"abstract_inverted_index":{"The":[0,55],"U-curve":[1,31,61],"branch-and-bound":[2],"algorithm":[3,20,63],"for":[4,21],"optimization":[5],"was":[6],"introduced":[7],"recently":[8],"by":[9],"Ris":[10],"and":[11,45,51,67],"collaborators.":[12],"In":[13],"this":[14],"paper":[15],"we":[16],"introduce":[17],"an":[18],"improved":[19],"finding":[22],"the":[23,30,39,42,52,59,72],"optimal":[24],"set":[25],"of":[26,41],"features":[27],"based":[28],"on":[29],"assumption.":[32],"Synthetic":[33],"experiments":[34],"are":[35],"used":[36],"to":[37,48],"asses":[38],"performance":[40],"proposed":[43],"algorithm,":[44],"compare":[46],"it":[47],"exhaustive":[49],"search":[50],"original":[53,73],"algorithm.":[54,74],"results":[56],"show":[57],"that":[58],"modified":[60],"BB":[62],"makes":[64],"fewer":[65],"evaluations":[66],"is":[68],"more":[69],"robust":[70],"than":[71]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}