{"id":"https://openalex.org/W157953303","doi":"https://doi.org/10.1090/dimacs/020/02","title":"Practical problem solving with cutting plane algorithms in combinatorial optimization","display_name":"Practical problem solving with cutting plane algorithms in combinatorial optimization","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W157953303","doi":"https://doi.org/10.1090/dimacs/020/02","mag":"157953303"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/020/02","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/020/02","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5110594951","display_name":"Michael J\u00fcnger","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M Junger","raw_affiliation_strings":["Rice University, Houston, TX"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, TX","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000892313","display_name":"Gerhard Reinelt","orcid":"https://orcid.org/0000-0002-7193-501X"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G Reinelt","raw_affiliation_strings":["Yale University, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028107064","display_name":"Stefan Thienel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Thienel","raw_affiliation_strings":["Bellcore, Morristown, NJ"],"affiliations":[{"raw_affiliation_string":"Bellcore, Morristown, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110594951"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":34.0389,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.99936508,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9526000022888184,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9467999935150146,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.567440390586853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5312138795852661},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4773571491241455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41838937997817993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4131006896495819},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2631703317165375},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0750245749950409},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.0457075834274292}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.567440390586853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5312138795852661},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4773571491241455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41838937997817993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4131006896495819},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2631703317165375},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0750245749950409},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.0457075834274292}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1090/dimacs/020/02","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/020/02","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:USBKOELN.ub.uni-koeln.de:54685","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400371","display_name":"K\u00f6lner Universit\u00e4ts PublikationsServer (Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210115942","host_organization_name":"Rhenish Institute for Environmental Research","host_organization_lineage":["https://openalex.org/I4210115942"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:156","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/156/1/zpr94-156.ps","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Collection Item"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.3797","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.3797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.mi.uni-koeln.de/pub/paper/postscript/zpr94-156.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.8055","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.8055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.ZPR.uni-koeln.de/pub/paper/zpr94-156.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.5689","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iwr.uni-heidelberg.de/iwr/comopt/publications/p94-24.PS.gz","raw_type":"text"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:860","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/860/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Collection Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W1513565830","https://openalex.org/W2080278356","https://openalex.org/W4394660760","https://openalex.org/W3012113686","https://openalex.org/W2390699817","https://openalex.org/W1996239617","https://openalex.org/W3197304203","https://openalex.org/W2023242492"],"abstract_inverted_index":{"Cutting":[0],"plane":[1,52],"algorithms":[2,29,53,93],"have":[3],"turned":[4],"out":[5,87],"to":[6,35,46,50,64,98,105],"be":[7],"practically":[8,71],"successful":[9,72,122],"computational":[10],"tools":[11],"in":[12,15,21,33,70,89,112,125],"combinatorial":[13,38],"optimization,":[14],"particular,":[16],"when":[17],"they":[18],"are":[19,30,94],"embedded":[20],"a":[22],"branch-and-bound":[23],"framework.":[24],"Implementations":[25],"of":[26,42,58,74,82,121],"such":[27],"''branch-and-cut''":[28],"rather":[31],"complicated":[32],"comparison":[34],"many":[36],"purely":[37],"algorithms.":[39,76],"The":[40],"purpose":[41],"this":[43],"article":[44],"is":[45,62],"give":[47],"an":[48,55,119],"introduction":[49],"cutting":[51],"from":[54],"implementor's":[56],"point":[57,86],"view.":[59],"Special":[60],"emphasis":[61],"given":[63],"control":[65],"and":[66],"data":[67],"structures":[68],"used":[69],"implementations":[73],"branch-and-cut":[75,92],"We":[77,116],"also":[78,103],"address":[79],"the":[80,106,126],"issue":[81],"parallelization.":[83],"Finally,":[84],"we":[85],"that":[88],"important":[90],"applications":[91,124],"not":[95],"only":[96],"able":[97],"produce":[99],"optimal":[100],"solutions":[101],"but":[102],"approximations":[104],"optimum":[107],"with":[108,118],"certified":[109],"good":[110],"quality":[111],"moderate":[113],"computation":[114],"times.":[115],"close":[117],"overview":[120],"practical":[123],"literature.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}