{"id":"https://openalex.org/W2156732286","doi":null,"title":"CUTTING PLANE METHODS FOR GENERAL INTEGER PROGRAMMING","display_name":"CUTTING PLANE METHODS FOR GENERAL INTEGER PROGRAMMING","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2156732286","mag":"2156732286"},"language":"en","primary_location":{"id":"pmh:oai:bura.brunel.ac.uk:2438/2286","doi":null,"is_oa":true,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/2286","pdf_url":"http://bura.brunel.ac.uk/bitstream/2438/2286/1/TR_04_93.pdf","source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://bura.brunel.ac.uk/bitstream/2438/2286/1/TR_04_93.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fatimah Abdul Hamid","orcid":"https://orcid.org/0000-0001-8436-6840","observed_orcids":["https://orcid.org/0000-0001-8436-6840"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fatimah Abdul Hamid","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8436-6840","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108385781","display_name":"Gautam Mitra","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gautam Mitra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111929006","display_name":"Ken Darby-Dowman","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K Darby-Dowman","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.3672,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51221122,"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.8398000001907349,"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.8398000001907349,"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.1371999979019165,"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.01640000008046627,"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/cutting-plane-method","display_name":"cutting plane method","score":0.9480000138282776},{"id":"https://openalex.org/keywords/integer-programming","display_name":"integer programming","score":0.9810000061988831},{"id":"https://openalex.org/keywords/dantzig-wolfe-decomposition","display_name":"Dantzig-Wolfe decomposition","score":0.8529999852180481},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.7409999966621399},{"id":"https://openalex.org/keywords/convergence","display_name":"convergence","score":0.3089999854564667},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.5299999713897705},{"id":"https://openalex.org/keywords/storage-requirements","display_name":"storage requirements","score":0.7620000243186951}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6280329823493958},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5246936678886414},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45420169830322266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41862472891807556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3973138928413391},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2886029779911041},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15120655298233032}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:bura.brunel.ac.uk:2438/2286","doi":null,"is_oa":true,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/2286","pdf_url":"http://bura.brunel.ac.uk/bitstream/2438/2286/1/TR_04_93.pdf","source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.601.9603","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.601.9603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bura.brunel.ac.uk/bitstream/2438/2286/1/TR_04_93.pdf","raw_type":"text"},{"id":"mag:2156732286","doi":null,"is_oa":false,"landing_page_url":"https://bura.brunel.ac.uk/bitstream/2438/2286/1/TR_04_93.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":{"id":"pmh:oai:bura.brunel.ac.uk:2438/2286","doi":null,"is_oa":true,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/2286","pdf_url":"http://bura.brunel.ac.uk/bitstream/2438/2286/1/TR_04_93.pdf","source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2156732286.pdf","grobid_xml":"https://content.openalex.org/works/W2156732286.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W230434767","https://openalex.org/W288256330","https://openalex.org/W1492984840","https://openalex.org/W1968143987","https://openalex.org/W1983132195","https://openalex.org/W1983222810","https://openalex.org/W1986156025","https://openalex.org/W2008736679","https://openalex.org/W2009683816","https://openalex.org/W2026994686","https://openalex.org/W2038141985","https://openalex.org/W2041621614","https://openalex.org/W2055163563","https://openalex.org/W2058937865","https://openalex.org/W2087799931","https://openalex.org/W2101004608","https://openalex.org/W2103254960","https://openalex.org/W2116421224","https://openalex.org/W2126369429","https://openalex.org/W2152939132","https://openalex.org/W2166628180","https://openalex.org/W2336259629","https://openalex.org/W2531550286","https://openalex.org/W3109119980"],"related_works":["https://openalex.org/W66862490","https://openalex.org/W4410085733","https://openalex.org/W4405313447","https://openalex.org/W2393089103","https://openalex.org/W2352620736","https://openalex.org/W41132256","https://openalex.org/W7096745488","https://openalex.org/W4302819359","https://openalex.org/W1965740321","https://openalex.org/W1550748626"],"abstract_inverted_index":{"Integer":[0],"programming":[1,38],"(IP)":[2],"problems":[3,21],"are":[4,32,79,92,98,102,118],"difficult":[5],"to":[6,9,34,74,77,89,104],"solve":[7],"due":[8,73],"the":[10,23,35,54],"integer":[11,43,64],"restrictions":[12],"imposed":[13],"on":[14],"them.":[15],"A":[16],"technique":[17],"for":[18,70],"solving":[19,71],"these":[20,96],"is":[22,46],"cutting":[24,83,116],"plane":[25,84],"method.":[26],"In":[27,66],"this":[28,67],"method,":[29],"linear":[30,37],"constraints":[31,49],"added":[33],"associated":[36],"(LP)":[39],"problem":[40],"until":[41],"an":[42,109],"optimal":[44],"solution":[45,56],"found.":[47],"These":[48],"cut":[50],"off":[51],"part":[52],"of":[53],"LP":[55],"space":[57],"but":[58],"do":[59],"not":[60,120],"eliminate":[61],"any":[62],"feasible":[63],"solution.":[65],"report":[68],"algorithms":[69],"IP":[72],"Gomory":[75],"and":[76,86,108],"Dantzig":[78],"presented.":[80],"Two":[81],"other":[82],"approaches":[85],"two":[87],"extensions":[88],"Gomory's":[90],"algorithm":[91],"also":[93],"discussed.":[94],"Although":[95],"methods":[97],"mathematically":[99],"elegant":[100],"they":[101],"known":[103],"have":[105],"slow":[106],"convergence":[107],"explosive":[110],"storage":[111],"requirement.":[112],"As":[113],"a":[114],"result":[115],"planes":[117],"generally":[119],"computationally":[121],"successful.":[122]},"counts_by_year":[],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}