{"id":"https://openalex.org/W200928306","doi":null,"title":"Binary Integer Linear Programming: A Hybrid Implicit Enumeration Approach.","display_name":"Binary Integer Linear Programming: A Hybrid Implicit Enumeration Approach.","publication_year":1980,"publication_date":"1980-12-01","ids":{"openalex":"https://openalex.org/W200928306","mag":"200928306"},"language":"en","primary_location":{"id":"pmh:ADA097108","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA097108","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},"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/A5079663059","display_name":"Nancy Eileen Jacqmin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jacqmin,Nancy Eileen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5079663059"],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5121999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5121999979019165,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.27000001072883606,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.179299995303154,"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/binary-integer-linear-programming","display_name":"binary integer linear programming","score":0.996999979019165},{"id":"https://openalex.org/keywords/implicit-enumeration","display_name":"implicit enumeration","score":0.9729999899864197},{"id":"https://openalex.org/keywords/hybrid-method","display_name":"hybrid algorithm","score":0.8399999737739563},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7559999823570251},{"id":"https://openalex.org/keywords/penalty-function","display_name":"penalty method","score":0.44600000977516174},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.3100000023841858}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7487188577651978},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7003835439682007},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6361639499664307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5959821939468384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.592120349407196},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5701794028282166},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5300089120864868},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5187485218048096},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4984471797943115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47057148814201355},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4153529107570648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3199717700481415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1436728835105896},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07844811677932739},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:ADA097108","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA097108","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"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/W1587953391","https://openalex.org/W2272677643","https://openalex.org/W3124620895","https://openalex.org/W2969852525","https://openalex.org/W2370951264","https://openalex.org/W2352211938","https://openalex.org/W7095554193","https://openalex.org/W249263462","https://openalex.org/W6989153899","https://openalex.org/W7099362769"],"abstract_inverted_index":{"This":[0,14,73],"report":[1],"develops":[2],"a":[3,18,24,78,110,149,158],"hybrid":[4],"algorithm":[5,106,130],"to":[6,23,36,101,133,147],"solve":[7],"the":[8,34,39,44,54,64,97,129,155,163],"binary":[9,59,119,123,152],"integer":[10],"linear":[11,19,27],"programming":[12],"problem.":[13],"problem":[15],"involves":[16],"optimizing":[17],"objective":[20],"function":[21,165],"subject":[22],"set":[25,55],"of":[26,49,56,61,80,88,91,99,136],"inequalities":[28],"where,":[29],"in":[30,96],"addition,":[31,140],"we":[32],"require":[33],"variables":[35,65],"take":[37],"on":[38,162],"value":[40,166],"0":[41],"or":[42],"1.":[43],"approach":[45],"developed":[46],"is":[47,66,74,95,131,145,167],"that":[48,52,104],"implicit":[50],"enumeration;":[51],"is,":[53],"all":[57],"possible":[58],"combinations":[60],"values":[62],"for":[63],"searched":[67],"without":[68],"considering":[69],"each":[70,135],"combination":[71],"explicitly.":[72],"accomplished":[75],"by":[76],"applying":[77],"series":[79],"tests":[81,100,125],"which":[82],"when":[83],"satisfied":[84],"allow":[85],"immediate":[86],"elimination":[87],"large":[89],"subsets":[90],"these":[92],"completions.":[93],"It":[94],"choice":[98],"be":[102,108],"used":[103,146],"this":[105],"may":[107],"termed":[109],"hybrid.":[111],"Borrowing":[112],"penalties":[113],"and":[114,121],"pseudocosts":[115],"as":[116,118],"well":[117],"infeasibility":[120,124],"conditional":[122],"from":[126],"previous":[127],"approaches,":[128],"built":[132],"use":[134],"their":[137],"strengths.":[138],"In":[139],"an":[141],"existing":[142],"heuristic":[143],"procedure":[144],"generate":[148],"good":[150,159],"feasible":[151],"point":[153],"at":[154],"outset.":[156],"Thus,":[157],"initial":[160],"bound":[161],"optimal":[164],"available.":[168],"(Author)":[169]},"counts_by_year":[],"updated_date":"2026-09-06T09:10:53.072986","created_date":"2025-10-10T00:00:00"}