{"id":"https://openalex.org/W2511431342","doi":"https://doi.org/10.7148/2016-0446","title":"Hybridising Local Search With Branch-And-Bound For Constrained Portfolio Selection Problems","display_name":"Hybridising Local Search With Branch-And-Bound For Constrained Portfolio Selection Problems","publication_year":2016,"publication_date":"2016-06-03","ids":{"openalex":"https://openalex.org/W2511431342","doi":"https://doi.org/10.7148/2016-0446","mag":"2511431342"},"language":"en","primary_location":{"id":"doi:10.7148/2016-0446","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2016-0446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2016 Proceedings edited by Thorsten Claus, Frank Herrmann, Michael Manitz, Oliver Rose","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/A5103262167","display_name":"Fang He","orcid":"https://orcid.org/0000-0001-6400-2628"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]},{"id":"https://openalex.org/I94951947","display_name":"University of Westminster","ror":"https://ror.org/04ycpbx82","country_code":"GB","type":"education","lineage":["https://openalex.org/I94951947"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Fang He","raw_affiliation_strings":["Department of Computer Science, Faculty of Science and Technology, University of Westminster, W1B 2HW, UK","The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science The University of Nottingham, Nottingham, NG8 1BB, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Science and Technology, University of Westminster, W1B 2HW, UK","institution_ids":["https://openalex.org/I94951947"]},{"raw_affiliation_string":"The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science The University of Nottingham, Nottingham, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063920690","display_name":"Rong Qu","orcid":"https://orcid.org/0000-0001-8318-7509"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rong Qu","raw_affiliation_strings":["The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science The University of Nottingham, Nottingham, NG8 1BB, UK"],"affiliations":[{"raw_affiliation_string":"The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science The University of Nottingham, Nottingham, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103262167"],"corresponding_institution_ids":["https://openalex.org/I142263535","https://openalex.org/I94951947"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70238569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"446","last_page":"452"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6531221270561218},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6363793611526489},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.509000301361084},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.46977394819259644},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.45143961906433105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4402264952659607},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42685768008232117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4181828796863556},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.08120149374008179}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6531221270561218},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6363793611526489},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.509000301361084},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.46977394819259644},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.45143961906433105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4402264952659607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42685768008232117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4181828796863556},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.08120149374008179},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7148/2016-0446","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2016-0446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2016 Proceedings edited by Thorsten Claus, Frank Herrmann, Michael Manitz, Oliver Rose","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1810055","https://openalex.org/W1594264634","https://openalex.org/W1989868235","https://openalex.org/W2027515466","https://openalex.org/W2045824363","https://openalex.org/W2052890323","https://openalex.org/W2069657950","https://openalex.org/W2096216097","https://openalex.org/W2106555029","https://openalex.org/W2144015438","https://openalex.org/W2166029977","https://openalex.org/W2170221568"],"related_works":["https://openalex.org/W3135784370","https://openalex.org/W4287273005","https://openalex.org/W2776473626","https://openalex.org/W1966028935","https://openalex.org/W1931020284","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W4394849239","https://openalex.org/W2182290077"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"investigate":[4],"a":[5,84,89,176,187],"constrained":[6],"portfolio":[7,179],"selection":[8,180],"problem":[9],"with":[10,33,83,182],"cardinality":[11,45,57],"constraint,":[12,58],"minimum":[13],"size":[14,109],"and":[15,18,101,133,186],"position":[16],"constraints,":[17],"non-convex":[19,183],"transaction":[20,184],"cost.A":[21],"hybrid":[22],"method":[23],"named":[24],"Local":[25],"Search":[26],"Branch-and-Bound":[27],"(LS-B&B)":[28],"which":[29,51],"integrates":[30],"local":[31,85],"search":[32,96,153,163],"B&B":[34,95],"is":[35,52,65,76,126,173],"proposed":[36],"based":[37,192],"on":[38,78,175,193],"the":[39,42,48,56,59,79,112,116,121,123,130,136,140,152,161,165,169,194,200,203],"property":[40],"of":[41,62,91,139,151,178,189,202],"problem,":[43],"i.e.":[44],"constraint.To":[46],"eliminate":[47],"computational":[49,208],"burden":[50],"mainly":[53],"due":[54,105],"to":[55,87,106,111,115,128,158,164,168],"corresponding":[60],"set":[61,177],"binary":[63],"variables":[64],"identified":[66,147],"as":[67],"core":[68,80],"variables.Variable":[69],"fixing":[70],"(Bixby,":[71],"Fenelon":[72],"et":[73],"al.":[74],"2000)":[75],"applied":[77],"variables,":[81],"together":[82],"search,":[86],"generate":[88],"sequence":[90],"simplified":[92,102],"sub-problems.The":[93],"default":[94],"then":[97],"solves":[98],"these":[99],"restricted":[100],"subproblems":[103,141,157],"optimally":[104],"their":[107],"reduced":[108],"comparing":[110],"original":[113,170],"one.Due":[114],"inherent":[117],"similar":[118],"structures":[119],"in":[120,142],"sub-problems,":[122],"solution":[124,167],"information":[125],"reused":[127],"evoke":[129],"repairing":[131],"heuristics":[132],"thus":[134],"accelerate":[135],"solving":[137],"procedure":[138],"B&B.The":[143],"tight":[144],"upper":[145],"bound":[146],"at":[148],"early":[149],"stage":[150],"can":[154],"discard":[155],"more":[156],"speed":[159],"up":[160],"LS-B&B":[162],"optimal":[166],"problem.Our":[171],"study":[172],"performed":[174],"problems":[181],"costs":[185],"number":[188],"trading":[190],"constraints":[191],"extended":[195],"mean-variance":[196],"model.Computational":[197],"experiments":[198],"demonstrate":[199],"effectiveness":[201],"algorithm":[204],"by":[205],"using":[206],"less":[207],"time.":[209]},"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}