{"id":"https://openalex.org/W2003266683","doi":"https://doi.org/10.1109/cdc.2011.6160651","title":"Hybrid combinatorial optimization: Sample problems and algorithms","display_name":"Hybrid combinatorial optimization: Sample problems and algorithms","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2003266683","doi":"https://doi.org/10.1109/cdc.2011.6160651","mag":"2003266683"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2011.6160651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6160651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","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/A5085821818","display_name":"Vaibhav Srivastava","orcid":"https://orcid.org/0000-0002-9786-0159"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vaibhav Srivastava","raw_affiliation_strings":["Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, Santa Barbara, CA, USA","Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, 93106 USA"],"affiliations":[{"raw_affiliation_string":"Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, 93106 USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068353454","display_name":"Francesco Bullo","orcid":"https://orcid.org/0000-0002-4785-2118"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francesco Bullo","raw_affiliation_strings":["Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, Santa Barbara, CA, USA","Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, 93106 USA"],"affiliations":[{"raw_affiliation_string":"Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Center for Control, Dynamical Systems, and Computation, University of California, Santa Barbara, 93106 USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085821818"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":3.0475,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.90797736,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"7212","last_page":"7217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994999766349792,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9810000061988831,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8421466946601868},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6863441467285156},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6059158444404602},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6041608452796936},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5879837870597839},{"id":"https://openalex.org/keywords/sigmoid-function","display_name":"Sigmoid function","score":0.544451117515564},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.528096616268158},{"id":"https://openalex.org/keywords/l-reduction","display_name":"L-reduction","score":0.5153519511222839},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"Discrete optimization","score":0.48483312129974365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4799378514289856},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4324011206626892},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.43076062202453613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4284181296825409},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4274086356163025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40570372343063354},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37742504477500916},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.1785704493522644},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.16701504588127136},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11356410384178162},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.0811675488948822}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8421466946601868},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6863441467285156},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6059158444404602},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6041608452796936},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5879837870597839},{"id":"https://openalex.org/C81388566","wikidata":"https://www.wikidata.org/wiki/Q526668","display_name":"Sigmoid function","level":3,"score":0.544451117515564},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.528096616268158},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.5153519511222839},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.48483312129974365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4799378514289856},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4324011206626892},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.43076062202453613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4284181296825409},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4274086356163025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40570372343063354},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37742504477500916},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.1785704493522644},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.16701504588127136},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11356410384178162},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0811675488948822},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2011.6160651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6160651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.1563","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.1563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://motion.me.ucsb.edu/pdf/2011n-sb.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W275157725","https://openalex.org/W1540474102","https://openalex.org/W1557310162","https://openalex.org/W1989953059","https://openalex.org/W2000533028","https://openalex.org/W2004732730","https://openalex.org/W2039730573","https://openalex.org/W2045625972","https://openalex.org/W2055053339","https://openalex.org/W2065356639","https://openalex.org/W2066931620","https://openalex.org/W2083571976","https://openalex.org/W2118402343","https://openalex.org/W2141433919","https://openalex.org/W2266946488","https://openalex.org/W2296319761","https://openalex.org/W4236127247","https://openalex.org/W4250589301","https://openalex.org/W4253284464","https://openalex.org/W6632178536"],"related_works":["https://openalex.org/W2359046253","https://openalex.org/W1527736507","https://openalex.org/W4378977544","https://openalex.org/W2353523849","https://openalex.org/W4309490307","https://openalex.org/W2366218906","https://openalex.org/W4375949242","https://openalex.org/W2945323293","https://openalex.org/W4255006213","https://openalex.org/W1991617942"],"abstract_inverted_index":{"We":[0,11,33,48],"study":[1],"a":[2,17],"class":[3],"of":[4,28,36],"non-convex":[5],"optimization":[6,22,56,66],"problems":[7],"involving":[8],"sigmoid":[9,14],"functions.":[10],"show":[12],"that":[13],"functions":[15],"impart":[16],"combinatorial":[18,55],"element":[19],"to":[20],"the":[21,37,41,50,54],"variables":[23],"and":[24,30,40,58],"make":[25],"them":[26],"hybrid":[27,46,65],"continuous":[29],"discrete":[31],"variables.":[32,47],"formulate":[34],"versions":[35],"knapsack":[38],"problem":[39,43],"bin-packing":[42],"with":[44],"such":[45],"utilize":[49],"approximation":[51,60],"algorithms":[52,61],"from":[53],"literature":[57],"develop":[59],"for":[62],"these":[63],"NP-hard":[64],"problems.":[67]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}