{"id":"https://openalex.org/W78958027","doi":null,"title":"Instructions for Using Experimental 0-1 Integer Linear Programming Code RIP23J.","display_name":"Instructions for Using Experimental 0-1 Integer Linear Programming Code RIP23J.","publication_year":1967,"publication_date":"1967-01-01","ids":{"openalex":"https://openalex.org/W78958027","mag":"78958027"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.868.7161","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.868.7161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dtic.mil/get-tr-doc/pdf?AD%3DAD0662007%26Location%3DU2%26doc%3DGetTRDoc.pdf","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/A5111807614","display_name":"Arthur M. Geoffrion","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arthur M. Geoffrion","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043617005","display_name":"Alfred B. Nelson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alfred B. Nelson","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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00691244,"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.5770999789237976,"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.5770999789237976,"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.3474000096321106,"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.049300000071525574,"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/integer-linear-programming","display_name":"integer linear programming","score":0.9319999814033508},{"id":"https://openalex.org/keywords/0-1-integer-programming","display_name":"0-1 integer programming","score":0.6880000233650208},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.5770000219345093},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.47999998927116394},{"id":"https://openalex.org/keywords/optimization-software","display_name":"optimization software","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7172129154205322},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.638930082321167},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5571218729019165},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5401986241340637},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5306462645530701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48313018679618835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4804612994194031},{"id":"https://openalex.org/C147700949","wikidata":"https://www.wikidata.org/wiki/Q6042594","display_name":"Integer points in convex polyhedra","level":4,"score":0.4364060163497925},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41900867223739624},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.40729978680610657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37283855676651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29184460639953613},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2753489017486572},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.06802448630332947},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04989400506019592}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.868.7161","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.868.7161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dtic.mil/get-tr-doc/pdf?AD%3DAD0662007%26Location%3DU2%26doc%3DGetTRDoc.pdf","raw_type":"text"},{"id":"mag:78958027","doi":null,"is_oa":false,"landing_page_url":"https://www.rand.org/pubs/papers/P3711.html","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":3,"referenced_works":["https://openalex.org/W249263462","https://openalex.org/W2045411541","https://openalex.org/W2093150123"],"related_works":["https://openalex.org/W7099514920","https://openalex.org/W2344277739","https://openalex.org/W3208516741","https://openalex.org/W1592032946","https://openalex.org/W7097070549","https://openalex.org/W3089363000","https://openalex.org/W238134454","https://openalex.org/W4248225706","https://openalex.org/W4247462033","https://openalex.org/W2521625024"],"abstract_inverted_index":{"Abstract":[0],":":[1],"The":[2],"program":[3,49],"solves":[4],"integer":[5,47],"linear":[6,48],"programs":[7],"of":[8],"the":[9,67],"form":[10],"(P)":[11],"Minimize":[12],"cx":[13],"subject":[14],"to":[15],"b":[16,35],"+":[17],"Ax":[18],"=":[19,25],"or":[20,27],"0,":[21],"x":[22,32],"sub":[23],"j":[24],"0":[26],"1":[28],"where":[29],"c":[30],"and":[31,39],"are":[33],"n-vectors,":[34],"is":[36,41,69],"an":[37],"m-vector,":[38],"A":[40],"m":[42],"by":[43],"n.":[44],"Any":[45],"bounded":[46],"can":[50],"be":[51],"written":[52],"in":[53,66],"this":[54],"form,":[55],"using":[56],"elementary":[57],"manipulations":[58],"if":[59],"necessary.":[60],"Familiarity":[61],"with":[62],"2":[63],"previous":[64],"papers":[65],"series":[68],"assumed.":[70]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}