{"id":"https://openalex.org/W2272677643","doi":null,"title":"Implicit enumeration algorithms for solving 0-1 integer linear programming problems","display_name":"Implicit enumeration algorithms for solving 0-1 integer linear programming problems","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2272677643","mag":"2272677643"},"language":"en","primary_location":{"id":"mag:2272677643","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=919977&coll=DL&dl=GUIDE","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","is_traditional":true,"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/A5010292419","display_name":"Narasimha R. Mannur","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Narasimha R. Mannur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5040221552","display_name":"Mark H. Karwan","orcid":"https://orcid.org/0000-0001-9478-6988","observed_orcids":["https://orcid.org/0000-0001-9478-6988"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark H. Karwan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9478-6988","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"180","last_page":"180"},"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.5023999810218811,"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.5023999810218811,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.4368000030517578,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.023499999195337296,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/implicit-enumeration","display_name":"implicit enumeration","score":0.8980000019073486},{"id":"https://openalex.org/keywords/0-1-integer-linear-programming","display_name":"0-1 integer linear programming","score":0.9789999723434448},{"id":"https://openalex.org/keywords/0-1-integer-programming","display_name":"0-1 integer programming","score":0.8420000076293945},{"id":"https://openalex.org/keywords/surrogate-relaxation","display_name":"surrogate relaxation","score":0.7649999856948853},{"id":"https://openalex.org/keywords/branching-rules","display_name":"branching rules","score":0.8389999866485596}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.9552701711654663},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5507321953773499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5332794785499573},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5247388482093811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5106564164161682},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.44304192066192627},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44151052832603455},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.43938273191452026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4061034321784973},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3615470230579376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3374186158180237},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16290098428726196},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2272677643","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=919977&coll=DL&dl=GUIDE","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":[],"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/W7095554193","https://openalex.org/W1587953391","https://openalex.org/W249263462","https://openalex.org/W2011563425","https://openalex.org/W2062436195","https://openalex.org/W2012761904","https://openalex.org/W2370951264","https://openalex.org/W2352211938","https://openalex.org/W200928306","https://openalex.org/W4210351379"],"abstract_inverted_index":{"The":[0,241],"implicit":[1,38,67,84,114,123,169,199,216],"enumeration":[2,39,68,85,115,124,170,200,217],"approaches":[3,69],"allow":[4],"us":[5,148],"solving":[6],"a":[7,72],"variety":[8],"of":[9,19,36,44,53,55,74,112,159,168,185,197,243],"combinatorial":[10],"problems,":[11],"specifically":[12],"binary":[13],"integer":[14,28],"linear":[15,29],"programs.":[16],"A":[17],"number":[18,73],"real":[20],"world":[21],"problems":[22,99,233,237],"can":[23],"be":[24],"formulated":[25],"using":[26,221,230],"0-1":[27],"programming.":[30],"This":[31,134,146],"resulted":[32],"in":[33,46,92,131],"the":[34,50,56,66,77,110,128,138,157,166,183,195,210,239],"development":[35],"many":[37],"algorithms":[40,58,94,125,171,218],"with":[41],"varying":[42],"degree":[43],"success":[45],"their":[47],"implementation.":[48],"However,":[49],"computational":[51,78],"effectiveness":[52,79],"some":[54],"early":[57,83],"has":[59],"not":[60],"been":[61],"fully":[62],"explored.":[63],"We":[64,87,117,202],"study":[65,182,204],"by":[70,126,143],"considering":[71],"algorithms.\r\nTo":[75],"compare":[76],"we":[80,172,181],"implement":[81],"three":[82],"algorithms.":[86,133],"synthesize":[88],"effective":[89,152,212],"techniques":[90],"present":[91],"different":[93,132,174,205],"and":[95,105,154,178,189,208,228,234],"develop":[96,118,173],"new":[97],"relaxation":[98,188,191],"to":[100,121,149,164],"obtain":[101],"stronger":[102],"bounds.":[103],"Fathoming":[104],"variable":[106],"setting":[107,179],"tests":[108,129,139,153,175,245],"form":[109],"core":[111],"any":[113],"algorithm.":[116,201],"an":[119,198],"approach":[120,136],"unify":[122],"analyzing":[127],"used":[130],"unifying":[135],"identifies":[137],"that":[140],"are":[141,219,246],"subsumed":[142],"other":[144],"tests.":[145,161],"allows":[147],"eliminate":[150],"less":[151],"also":[155],"avoids":[156],"use":[158],"redundant":[160],"In":[162],"addition,":[163],"improve":[165],"efficiency":[167,196],"for":[176],"filtering":[177],"variables.\r\nFurthermore,":[180],"effect":[184],"multiple":[186],"surrogate":[187,190],"bounds":[192],"on":[193],"improving":[194],"empirically":[203],"branching":[206,213],"methods,":[207],"identify":[209],"most":[211],"rules.":[214],"Different":[215],"developed":[220],"these":[222,244],"techniques.":[223],"All":[224],"methods":[225],"were":[226],"implemented":[227],"tested":[229],"randomly":[231],"generated":[232],"Petersen's":[235],"test":[236],"from":[238],"literature.":[240],"results":[242],"reported.":[247]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}