{"id":"https://openalex.org/W1587953391","doi":"https://doi.org/10.1016/s0304-0208(08)73464-9","title":"A Bounding Technique for Integer Linear Programming with Binary Variables","display_name":"A Bounding Technique for Integer Linear Programming with Binary Variables","publication_year":1981,"publication_date":"1981-01-01","ids":{"openalex":"https://openalex.org/W1587953391","doi":"https://doi.org/10.1016/s0304-0208(08)73464-9","mag":"1587953391"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-0208(08)73464-9","doi":"https://doi.org/10.1016/s0304-0208(08)73464-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-0208(08)73464-9","pdf_url":null,"source":{"id":"https://openalex.org/S68263103","display_name":"North-Holland mathematics studies","issn_l":"0304-0208","issn":["0304-0208","2212-1048"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"North-Holland Mathematics Studies","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4244726558","display_name":"Annals of Discrete Mathematics (11) - Studies on Graphs and Discrete Programming"},"type":"book-chapter","is_traditional":true,"indexed_in":["crossref"],"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/A5108708547","display_name":"Frederick S. Hillier","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Frederick S. Hillier","raw_affiliation_strings":["Department of Operations Research, Stanford University, Stanford CA 94305, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Stanford University, Stanford CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079663059","display_name":"Nancy Eileen Jacqmin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I184840846","display_name":"Virginia Commonwealth University","ror":"https://ror.org/02nkdxk79","country_code":"US","type":"education","lineage":["https://openalex.org/I184840846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nancy Eileen Jacqmin","raw_affiliation_strings":["Department of Mathematical Sciences, Virginia Commonwealth University, Richmond, VA 23284, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Virginia Commonwealth University, Richmond, VA 23284, USA","institution_ids":["https://openalex.org/I184840846"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":"167","last_page":"176"},"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.7089999914169312,"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.7089999914169312,"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.23360000550746918,"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.030500000342726707,"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.9369999766349792},{"id":"https://openalex.org/keywords/binary-variables","display_name":"binary variables","score":0.9959999918937683},{"id":"https://openalex.org/keywords/bounding-techniques","display_name":"bounding techniques","score":0.8610000014305115},{"id":"https://openalex.org/keywords/implicit-enumeration","display_name":"implicit enumeration","score":0.9789999723434448},{"id":"https://openalex.org/keywords/variable-fixing","display_name":"variable fixing","score":0.8429999947547913},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7020000219345093},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8790000081062317}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.902928352355957},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7068182826042175},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6193510293960571},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5904102325439453},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.5458259582519531},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5412715077400208},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5254653692245483},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48292800784111023},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46865835785865784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43667882680892944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4301162660121918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41359394788742065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20433646440505981},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07622277736663818},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07617956399917603},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.03695538640022278}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-0208(08)73464-9","doi":"https://doi.org/10.1016/s0304-0208(08)73464-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-0208(08)73464-9","pdf_url":null,"source":{"id":"https://openalex.org/S68263103","display_name":"North-Holland mathematics studies","issn_l":"0304-0208","issn":["0304-0208","2212-1048"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"North-Holland Mathematics Studies","raw_type":"book-chapter"},{"id":"pmh:ADA075575","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA075575","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":9,"referenced_works":["https://openalex.org/W1967508804","https://openalex.org/W1982719520","https://openalex.org/W2023224816","https://openalex.org/W2026106837","https://openalex.org/W2032107708","https://openalex.org/W2045411541","https://openalex.org/W2100890245","https://openalex.org/W2106433410","https://openalex.org/W2157311123"],"related_works":["https://openalex.org/W2272677643","https://openalex.org/W2352211938","https://openalex.org/W2024298120","https://openalex.org/W200928306","https://openalex.org/W2736798367","https://openalex.org/W2038773690","https://openalex.org/W2040800819","https://openalex.org/W2070126933","https://openalex.org/W7095554193","https://openalex.org/W4250265406"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}