{"id":"https://openalex.org/W7205350","doi":null,"title":"A hybrid of tabu search and local descent algorithms with applications in artificial intelligence","display_name":"A hybrid of tabu search and local descent algorithms with applications in artificial intelligence","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W7205350","mag":"7205350"},"language":"en","primary_location":{"id":"mag:7205350","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=928121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5048876983","display_name":"Kristin P. Bennett","orcid":"https://orcid.org/0000-0002-8782-105X","observed_orcids":["https://orcid.org/0000-0002-8782-105X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kristin P. Bennett","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051685414","display_name":"Jennifer A. Blue","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jennifer A. Blue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4408,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67509345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.826200008392334,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.826200008392334,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.13089999556541443,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.012400000356137753,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/tabu-search","display_name":"tabu search","score":0.8529999852180481},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.9369999766349792},{"id":"https://openalex.org/keywords/frank-wolfe-algorithm","display_name":"Frank-Wolfe algorithm","score":0.9309999942779541},{"id":"https://openalex.org/keywords/polyhedral-regions","display_name":"polyhedral regions","score":0.7300000190734863},{"id":"https://openalex.org/keywords/decision-tree-pruning","display_name":"decision tree pruning","score":0.6610000133514404},{"id":"https://openalex.org/keywords/error-function","display_name":"error function","score":0.6439999938011169},{"id":"https://openalex.org/keywords/block-coordinate-descent","display_name":"block coordinate descent","score":0.890999972820282},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.8320000171661377},{"id":"https://openalex.org/keywords/binary-variables","display_name":"binary variables","score":0.7580000162124634},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"support vector machine","score":0.9750000238418579},{"id":"https://openalex.org/keywords/nonlinear-discriminant-analysis","display_name":"nonlinear discriminant analysis","score":0.5619999766349792},{"id":"https://openalex.org/keywords/linearly-constrained-optimization","display_name":"linearly constrained optimization","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8126968145370483},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.7435258626937866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5964946746826172},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5653282403945923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5598980784416199},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.52264404296875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48626983165740967},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.44739145040512085},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.4275393486022949},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42646482586860657},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.42257747054100037},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3888836205005646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3694259524345398}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:7205350","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=928121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5299999713897705},{"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4000000059604645}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2067376465","https://openalex.org/W2250815205","https://openalex.org/W3097575425","https://openalex.org/W1995714897","https://openalex.org/W2050308130","https://openalex.org/W2146469507","https://openalex.org/W2794858631","https://openalex.org/W2971188044","https://openalex.org/W7112352824","https://openalex.org/W2031804592"],"abstract_inverted_index":{"We":[0,68,149,229,296],"introduce":[1],"the":[2,71,106,157,190,273,279,293],"idea":[3],"of":[4,94,109,138,159,201,224,249,257,275,281,303],"combining":[5],"a":[6,13,26,43,54,59,64,92,95,102,110,160,199,202,210,221,231,235,243,260],"fast":[7],"local":[8,27,33,55,98,206],"descent":[9,19,60,99,207],"method":[10],"with":[11,12,120,173],"robust":[14],"tabu":[15,103,211],"search":[16,36,47,66,73,104,212],"method.":[17],"A":[18],"algorithm":[20,61,100,185,208],"will":[21],"stop":[22],"when":[23],"it":[24],"reaches":[25],"minimum.":[28],"To":[29],"move":[30,51],"beyond":[31],"this":[32],"minimum":[34,56],"and":[35,62,101,209,267],"for":[37,123,155,176,234],"better":[38],"solutions,":[39],"we":[40],"have":[41],"developed":[42],"hybrid":[44,83,88,195],"algorithm.":[45],"Tabu":[46],"is":[48,79,91,129,132,182,186,198,242],"used":[49],"to":[50,117,189,220,259,263,300],"away":[52],"from":[53],"encountered":[57],"by":[58,291],"into":[63],"new":[65,152,232],"space.":[67],"alternate":[69],"between":[70],"two":[72,286],"methods":[74],"until":[75],"some":[76],"stopping":[77],"criteria":[78],"met.":[80],"Two":[81],"different":[82],"algorithms":[84],"are":[85,253,288],"introduced.\r\nThe":[86],"first":[87],"algorithm,":[89,196],"HEPTS,":[90],"combination":[93,200],"Frank-Wolfe":[96],"type":[97,137,205],"on":[105,135,213,272],"extreme":[107,126,179],"points":[108],"polyhedral":[111],"region.":[112],"HEPTS":[113],"can":[114,141,166,217],"be":[115,142,167,218],"applied":[116,188,219],"any":[118],"problem":[119,172,268],"linear":[121,174],"constraints":[122,175],"which":[124,177,239],"an":[125,170,178],"point":[127,180],"solution":[128,181],"desired.":[130,183],"There":[131],"no":[133],"restriction":[134],"what":[136],"objective":[139],"function":[140],"posed;":[143],"nonlinear,":[144],"non-differentiable,":[145],"or":[146],"even":[147],"non-continuous.":[148],"develop":[150],"three":[151],"error":[153,158],"functions":[154],"minimizing":[156],"decision":[161,164,191,236,241],"tree.":[162],"The":[163],"tree":[165,192,237],"formulated":[168],"as":[169],"optimization":[171,227],"Our":[184],"then":[187,297],"problem.\r\nOur":[193],"second":[194],"HMITS,":[197],"block":[203],"coordinate":[204],"binary":[214],"variables.":[215],"HMITS":[216,299],"large":[222],"class":[223],"mixed":[225],"integer":[226],"problems.":[228],"propose":[230],"formulation":[233],"in":[238],"each":[240],"support":[244,250,304],"vector":[245,251,305],"machine.":[246],"Three":[247],"benefits":[248,287],"machines":[252],"maximal":[254],"margins,":[255],"mapping":[256],"data":[258],"higher":[261],"dimension":[262,280],"construct":[264],"nonlinear":[265],"discriminants,":[266],"size":[269],"depending":[270],"only":[271,290],"number":[274],"training":[276],"data,":[277],"not":[278],"that":[282],"data.":[283],"These":[284],"last":[285],"gained":[289],"considering":[292],"dual":[294],"problem.":[295],"apply":[298],"three-decision":[301],"trees":[302],"machines.":[306]},"counts_by_year":[],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2016-06-24T00:00:00"}