{"id":"https://openalex.org/W887262018","doi":"https://doi.org/10.6084/m9.figshare.953137.v2","title":"An Algorithm for Binary Linear Programming","display_name":"An Algorithm for Binary Linear Programming","publication_year":2014,"publication_date":"2014-03-06","ids":{"openalex":"https://openalex.org/W887262018","doi":"https://doi.org/10.6084/m9.figshare.953137.v2","mag":"887262018"},"language":"en","primary_location":{"id":"mag:887262018","doi":"https://doi.org/10.6084/m9.figshare.953137.v2","is_oa":false,"landing_page_url":"http://www.scienpress.com/Upload/JAMB/Vol%204_3_2.pdf","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/A5112013485","display_name":"Subhendu Das","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Subhendu Das","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5112013485"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.586899995803833,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.586899995803833,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2791000008583069,"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.12430000305175781,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-linear-programming","display_name":"binary linear programming","score":0.9990000128746033},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.9070000052452087},{"id":"https://openalex.org/keywords/correlation-matrix","display_name":"correlation matrix","score":0.9610000252723694},{"id":"https://openalex.org/keywords/pseudoinverse","display_name":"pseudoinverse","score":0.6620000004768372},{"id":"https://openalex.org/keywords/optimality-conditions","display_name":"optimality conditions","score":0.890999972820282},{"id":"https://openalex.org/keywords/termination-conditions","display_name":"termination conditions","score":0.699999988079071},{"id":"https://openalex.org/keywords/existence-and-uniqueness-of-solutions","display_name":"existence and uniqueness of solutions","score":0.6660000085830688}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7734717726707458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7339946031570435},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7132599949836731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.606181800365448},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6016340255737305},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.5858216285705566},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5469272136688232},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.46613332629203796},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.4472605884075165},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4365622401237488},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.42082178592681885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41417625546455383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3133372664451599},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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":"mag:887262018","doi":"https://doi.org/10.6084/m9.figshare.953137.v2","is_oa":false,"landing_page_url":"http://www.scienpress.com/Upload/JAMB/Vol%204_3_2.pdf","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W154461797","https://openalex.org/W1603463019","https://openalex.org/W2008772536","https://openalex.org/W2066671865","https://openalex.org/W2127470768"],"related_works":["https://openalex.org/W4394994577","https://openalex.org/W2788003279","https://openalex.org/W2574400595","https://openalex.org/W2101165315","https://openalex.org/W2020361255","https://openalex.org/W2238878361","https://openalex.org/W6959596708","https://openalex.org/W1501168133","https://openalex.org/W2081929325","https://openalex.org/W2088880008"],"abstract_inverted_index":{"A":[0],"polynomial":[1],"time":[2],"algorithm,":[3],"which":[4],"is":[5,16,26,32,72,108],"a":[6,85],"modification":[7],"of":[8,35,38,61,70,79,92,95,114,126],"the":[9,33,39,57,62,75,80,90,115,138],"simplex":[10],"algorithm":[11,65],"for":[12,18,42,134],"Linear":[13,21],"Programming":[14,22],"(LP),":[15],"presented":[17,54],"solving":[19],"Binary":[20],"(BLP)":[23],"problems.":[24],"It":[25,83],"an":[27,124],"n-step":[28],"process":[29],"where":[30],"n":[31],"number":[34],"binary":[36,132],"variables":[37,135],"problem.":[40],"Conditions":[41],"existence,":[43],"uniqueness,":[44],"termination,":[45],"and":[46,59,98,117],"optimality":[47],"are":[48,53],"discussed.":[49],"Three":[50],"numerical":[51],"examples":[52],"to":[55,130,137],"explain":[56],"details":[58],"features":[60],"algorithm.":[63],"The":[64,102],"generates":[66],"two":[67,121],"matrices.":[68],"One":[69],"them":[71],"based":[73],"on":[74],"minimum":[76],"ratio":[77,91],"concept":[78],"Simplex":[81],"method.":[82],"creates":[84],"Ratio":[86],"Test":[87],"Matrix":[88],"from":[89,110],"corresponding":[93,136],"elements":[94],"b":[96],"vector":[97],"all":[99],"column":[100],"vectors.":[101],"other":[103],"matrix,":[104],"called":[105],"Correlation":[106],"Matrix,":[107],"generated":[109],"pseudo":[111],"inverse":[112],"estimates":[113],"primal":[116],"dual":[118],"variables.":[119],"These":[120],"matrices":[122],"provide":[123],"array":[125],"Column":[127],"Selection":[128],"Logic":[129],"assign":[131],"values":[133],"matrix":[139],"columns.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}