{"id":"https://openalex.org/W2039712900","doi":"https://doi.org/10.1287/opre.25.2.352","title":"Technical Note\u2014On Intersection Cuts in Interval Integer Linear Programming","display_name":"Technical Note\u2014On Intersection Cuts in Interval Integer Linear Programming","publication_year":1977,"publication_date":"1977-04-01","ids":{"openalex":"https://openalex.org/W2039712900","doi":"https://doi.org/10.1287/opre.25.2.352","mag":"2039712900"},"language":"en","primary_location":{"id":"doi:10.1287/opre.25.2.352","doi":"https://doi.org/10.1287/opre.25.2.352","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.25.2.352","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},"volume":null,"type":"article","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/A5043185084","display_name":"A. Charnes","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Charnes","raw_affiliation_strings":["University of Texas, Austin, Texas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas, Austin, Texas","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081368387","display_name":"Daniel Granot","orcid":"https://orcid.org/0000-0001-5779-1032","observed_orcids":["https://orcid.org/0000-0001-5779-1032"]},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Daniel Granot","raw_affiliation_strings":["Simon Fraser University, Burnaby, British Columbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, British Columbia","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030418998","display_name":"Frieda Granot","orcid":"https://orcid.org/0000-0002-7083-919X","observed_orcids":["https://orcid.org/0000-0002-7083-919X"]},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Frieda Granot","raw_affiliation_strings":["University of British Columbia, Vancouver, British Columbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, British Columbia","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"25","issue":"2","first_page":"352","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.551800012588501,"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.551800012588501,"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.2581000030040741,"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.12099999934434891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/intersection-cuts","display_name":"intersection cuts","score":0.9900000095367432},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.8769999742507935},{"id":"https://openalex.org/keywords/integer-programming","display_name":"integer programming","score":0.734000027179718},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"interval arithmetic","score":0.39800000190734863},{"id":"https://openalex.org/keywords/problem-size-reduction","display_name":"problem size reduction","score":0.4819999933242798}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.8421041965484619},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.8137099742889404},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.8066630363464355},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.700293242931366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6514683365821838},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6459901332855225},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6257021427154541},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6143549084663391},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5958037972450256},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5508060455322266},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5052435994148254},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4955524206161499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33273905515670776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2713935077190399},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23187687993049622},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0515885055065155},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/opre.25.2.352","doi":"https://doi.org/10.1287/opre.25.2.352","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.25.2.352","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2018958070","https://openalex.org/W2031828610","https://openalex.org/W2037711423","https://openalex.org/W2053060496","https://openalex.org/W2056782275","https://openalex.org/W2082139992","https://openalex.org/W2097969675","https://openalex.org/W2162246428","https://openalex.org/W2171238021","https://openalex.org/W2326954772","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2017752104","https://openalex.org/W4405313447","https://openalex.org/W2056782275","https://openalex.org/W2110818895","https://openalex.org/W2725620430","https://openalex.org/W2019333484","https://openalex.org/W2137740214","https://openalex.org/W2305705669","https://openalex.org/W113043827","https://openalex.org/W2171238021"],"abstract_inverted_index":{"In":[0],"this":[1],"note":[2],"we":[3],"use":[4],"the":[5,34,39,44,58,62],"concept":[6],"of":[7,61],"intersection":[8],"cut,":[9],"introduced":[10],"by":[11],"Balas":[12],"for":[13,22],"integer":[14,24,50],"programming":[15,27],"problems,":[16],"to":[17,32],"develop":[18],"a":[19,53],"cutting-plane":[20,35],"algorithm":[21,36],"solving":[23],"interval":[25,40],"linear":[26],"problems.":[28],"The":[29],"idea":[30],"is":[31],"apply":[33],"directly":[37],"on":[38],"problem":[41,45],"without":[42],"transforming":[43],"into":[46],"an":[47],"equivalent":[48],"standard":[49],"problem.":[51,63],"Such":[52],"transformation":[54],"would":[55],"significantly":[56],"increase":[57],"effective":[59],"size":[60]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}