{"id":"https://openalex.org/W162889200","doi":"https://doi.org/10.1184/r1/6715511","title":"Cutting Planes for Mixed Integer Programming","display_name":"Cutting Planes for Mixed Integer Programming","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W162889200","doi":"https://doi.org/10.1184/r1/6715511","mag":"162889200"},"language":"en","primary_location":{"id":"pmh:oai:repository.cmu.edu:dissertations-1111","doi":null,"is_oa":true,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1111&context=dissertations","pdf_url":"http://repository.cmu.edu/dissertations/106","source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dissertations","raw_type":"text"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://repository.cmu.edu/dissertations/106","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007069709","display_name":"Andrea Qualizza","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qualizza, Andrea","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007069709"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"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.9990000128746033,"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.9990000128746033,"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.0005000000237487257,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/cutting-planes","display_name":"cutting planes","score":0.9430000185966492},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.9079999923706055},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"quadratically constrained quadratic programming","score":0.8690000176429749},{"id":"https://openalex.org/keywords/reformulation-linearization-technique","display_name":"reformulation-linearization technique","score":0.7689999938011169},{"id":"https://openalex.org/keywords/principal-minors","display_name":"principal minors","score":0.6449999809265137},{"id":"https://openalex.org/keywords/intersection-cuts","display_name":"intersection cuts","score":0.8479999899864197},{"id":"https://openalex.org/keywords/integer-hull","display_name":"integer hull","score":0.9729999899864197},{"id":"https://openalex.org/keywords/0-1-integer-programming","display_name":"0-1 integer programming","score":0.7609999775886536},{"id":"https://openalex.org/keywords/split-cuts","display_name":"split cuts","score":0.5929999947547913}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7376578450202942},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7253153324127197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6545968055725098},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.6161056160926819},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.607717752456665},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5713467001914978},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5428332090377808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5052638649940491},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.4979865550994873},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4979057312011719},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.4865116477012634},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4530167877674103},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4354060888290405},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41379499435424805},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.37786614894866943},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3209998607635498},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24672931432724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22100374102592468},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.21589884161949158},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1579866111278534},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13904890418052673},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:repository.cmu.edu:dissertations-1111","doi":null,"is_oa":true,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1111&context=dissertations","pdf_url":"http://repository.cmu.edu/dissertations/106","source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dissertations","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/6715511","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Cutting_Planes_for_Mixed_Integer_Programming/6715511","pdf_url":"https://figshare.com/articles/thesis/Cutting_Planes_for_Mixed_Integer_Programming/6715511","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.7057","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.7057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tepper.cmu.edu/%7E/media/files/tepper/extranet/academic%20programs/phd/dissertations/qualizza%20dissertation%20final.pdf","raw_type":"text"},{"id":"mag:162889200","doi":null,"is_oa":false,"landing_page_url":"http://repository.cmu.edu/dissertations/106/","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},{"id":"doi:10.1184/r1/6715511","doi":"https://doi.org/10.1184/r1/6715511","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6715511","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.1184/r1/6715511.v1","doi":"https://doi.org/10.1184/r1/6715511.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6715511.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:repository.cmu.edu:dissertations-1111","doi":null,"is_oa":true,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1111&context=dissertations","pdf_url":"http://repository.cmu.edu/dissertations/106","source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dissertations","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W162889200.pdf","grobid_xml":"https://content.openalex.org/works/W162889200.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W72849363","https://openalex.org/W81332608","https://openalex.org/W171072194","https://openalex.org/W180443138","https://openalex.org/W1564910180","https://openalex.org/W1571070457","https://openalex.org/W1816539071","https://openalex.org/W1878408459","https://openalex.org/W1968143987","https://openalex.org/W1970193303","https://openalex.org/W1971441351","https://openalex.org/W1976440936","https://openalex.org/W1993493269","https://openalex.org/W2000642309","https://openalex.org/W2011167315","https://openalex.org/W2021043398","https://openalex.org/W2021659530","https://openalex.org/W2031456204","https://openalex.org/W2034266713","https://openalex.org/W2039648193","https://openalex.org/W2041873708","https://openalex.org/W2048881327","https://openalex.org/W2049143039","https://openalex.org/W2052281387","https://openalex.org/W2058732533","https://openalex.org/W2071292024","https://openalex.org/W2076416724","https://openalex.org/W2086069279","https://openalex.org/W2100782434","https://openalex.org/W2103254960","https://openalex.org/W2105880662","https://openalex.org/W2106264302","https://openalex.org/W2108856420","https://openalex.org/W2111574881","https://openalex.org/W2113612338","https://openalex.org/W2118807841","https://openalex.org/W2125772126","https://openalex.org/W2143273327","https://openalex.org/W2150339943","https://openalex.org/W2151308681","https://openalex.org/W2154900771","https://openalex.org/W2157030448","https://openalex.org/W2160294322","https://openalex.org/W2171238021","https://openalex.org/W2296319761","https://openalex.org/W2336259629","https://openalex.org/W2490340839","https://openalex.org/W2495457432","https://openalex.org/W2912522929","https://openalex.org/W3122332902"],"related_works":["https://openalex.org/W2246482519","https://openalex.org/W80948162","https://openalex.org/W7097849171","https://openalex.org/W7062708097","https://openalex.org/W2134656724","https://openalex.org/W2134988767","https://openalex.org/W1593984123","https://openalex.org/W3196224389","https://openalex.org/W2041873708","https://openalex.org/W2508207548"],"abstract_inverted_index":{"My":[0,31],"work":[1,54,237,266,564],"focuses":[2],"on":[3,52,178,202,264,366,533,548,562,612],"cutting":[4,137],"planes":[5],"technology":[6],"in":[7,140,218,244,314,391,447,495,531,580,626,653,680],"Mixed":[8,28,295,553,683],"Integer":[9,29,296,338,349,554,684],"Programming.":[10],"I":[11,234,543],"explore":[12],"novel":[13],"classes":[14,153],"of":[15,23,34,44,67,119,154,204,222,247,252,289,303,312,383,407,453,465,477,490,501,510,518,597,599,644,650,659,662,677,693,717],"valid":[16,155,405,550],"linear":[17,21,65,83,117,127,156,305],"inequalities":[18,157,346,513,551],"to":[19,130,240,344,359,397,497,588,637,666,674,687,707],"strengthen":[20],"relaxations":[22,66,74],"both":[24,78,698],"Linear":[25,356,555],"and":[26,40,59,82,102,123,158,169,183,336,340,369,403,431,435,468,481,608,624,686],"Nonlinear":[27],"problems.":[30],"dissertation":[32],"consists":[33],"three":[35],"chapters":[36],"that":[37,100,189,320,615,635,656],"investigate":[38],"theoretically":[39],"computationally":[41],"the":[42,87,96,120,132,141,145,181,198,205,223,231,241,245,253,287,309,330,333,337,348,353,360,381,392,410,422,428,439,472,478,491,499,502,526,534,540,581,585,602,613,621,648,651,660,667,675,704,712,718],"families":[43,406,452],"cuts":[45,168,170,201,274,281,408,420,426,432,460,638,689,706,713],"considered.":[46],"The":[47,72,208],"first":[48,630],"chapter":[49,233,261,377,542,558],"is":[50,93,262,514,559],"based":[51,177,263,365,561,611],"joint":[53,265,563],"with":[55,77,267,400,565,641],"Prof.":[56,60,268,566],"Pietro":[57],"Belotti":[58],"Francois":[61],"Margot.":[62],"We":[63,114,150,271,285,328,592,629,669],"study":[64,151,214],"Quadratically":[68],"Constrained":[69,185],"Quadratic":[70,186],"Programs.":[71,556],"proposed":[73],"are":[75,372,570],"models":[76],"semi-definite":[79],"constraints":[80,84],"(PSD)":[81],"given":[85],"by":[86,715],"Reformulation":[88],"Linearization":[89],"Technique":[90],"(RLT).":[91],"It":[92,646],"known":[94,721],"from":[95,172,180,249,275,282,352,433,461,639,690],"literature":[97],"(Anstreicher,":[98],"2007)":[99],"PSD":[101,121,133,167,200],"RLT":[103,206],"used":[104,112],"together":[105],"yield":[106],"better":[107,193],"bounds":[108,194],"than":[109,195,711],"each":[110,485],"technique":[111],"separately.":[113],"adopt":[115],"a":[116,136,236,294,299,507,522,545,594,618,632,654,694],"outer-approximation":[118],"cone,":[122],"we":[124,159,341,378,443,449,458,700],"use":[125,286],"exclusively":[126],"programming":[128,385],"tools":[129],"enforce":[131],"condition":[134],"via":[135],"plane":[138],"approach":[139,191],"lifted":[142],"space":[143],"containing":[144,486],"Yij":[146],"=":[147],"xixj":[148],"variables.":[149,591],"new":[152,595,664,705],"test":[160],"their":[161],"effectiveness":[162],"empirically.":[163],"These":[164,419],"include":[165,421],"sparse":[166],"derived":[171,351],"principal":[173],"minors.":[174],"Computational":[175],"results":[176,625],"instances":[179,699],"GLOBALLib":[182],"Boxed":[184],"Programs":[187],"show":[188],"this":[190,213,376,398,672],"yields":[192],"using":[196],"solely":[197],"standard":[199],"top":[203],"inequalities.":[207],"C++":[209],"code":[210],"developed":[211],"for":[212,228,293,347,409,415,427,438,552,575,703],"has":[215,387],"been":[216,389],"included":[217],"Coin-OR":[219],"as":[220,279,308,529],"part":[221],"Couenne":[224],"project":[225],"(exact":[226],"solver":[227],"MINLPs).":[229],"In":[230,375,493,539,697],"second":[232],"present":[235,544],"closely":[238],"related":[239],"recent":[242],"developments":[243],"area":[246],"\\cuts":[248],"multiple":[250,691],"rows":[251,692],"simplex":[254,695],"tableau\"":[255],"(Andersen":[256],"et":[257],"al.,":[258],"2007).":[259],"This":[260,557],"Egon":[269,567],"Balas.":[270,568],"generate":[272,345],"intersection":[273,688],"lattice-free":[276],"convex":[277,310],"sets":[278],"lift-and-project":[280],"multiple-term":[283],"disjunctions.":[284],"concept":[288],"\\Disjunctive":[290],"Hull\"":[291],"defined":[292],"Program":[297,357],"at":[298,474],"fractional":[300],"vertex":[301,476,489],"v":[302,323],"its":[304],"relaxation":[306],"P":[307,315],"hull":[311],"points":[313],"satisfying":[316],"all":[317],"basic":[318],"disjunctions":[319,470,640],"cut":[321,604,652],"o":[322],"but":[324,413],"no":[325],"integer":[326,417,589],"point.":[327],"examine":[329],"relationship":[331],"between":[332],"Disjunctive":[334,361],"Hull":[335,339,350],"give":[342,701],"procedures":[343],"Cut":[354],"Generating":[355],"associated":[358,587],"Hull.":[362],"Strengthening":[363],"techniques":[364],"coefficient":[367],"modularization":[368],"monoidal":[370,603],"strengthening":[371,549,573,605,622,722],"also":[373,379,560],"discussed.":[374],"analyze":[380],"case":[382,412,676],"0-1":[384,411,440,537],"which":[386,448],"not":[388],"covered":[390],"literature.":[393],"Our":[394],"framework":[395],"applies":[396,636],"setting":[399],"minor":[401],"changes":[402],"produces":[404],"invalid":[414],"general":[416,633],"programs.":[418],"triangle,":[423],"quadrilateral,":[424],"split":[425,678],"MIP":[429],"case,":[430],"cones":[434,437],"truncated":[436],"setting.":[441],"Moreover":[442],"run":[444],"an":[445,487],"experiment":[446],"separate":[450],"two":[451,482,571,719],"non":[454,503],"facet":[455,504,511],"defining":[456,505,512],"cuts:":[457],"consider":[459],"fixed":[462],"shape":[463],"triangles":[464],"type":[466,519],"1":[467,520],"conic":[469],"having":[471],"apex":[473],"one":[475,598],"unit":[479],"cube":[480],"extreme":[483],"rays,":[484],"additional":[488],"cube.":[492],"practice,":[494],"order":[496],"match":[498],"strength":[500],"inequalities,":[506],"large":[508],"number":[509,643],"typically":[515],"needed.":[516],"Triangles":[517],"produce":[521],"consistent":[523],"improvement":[524],"over":[525],"Gomory":[527,682],"cuts,":[528,679,685],"shown":[530],"experiments":[532],"MIPLIB":[535],"3":[536],"instances.":[538],"third":[541],"theoretical":[546],"result":[547,634,673],"There":[569],"distinct":[572],"methods":[574],"disjunctive":[576],"cuts;":[577],"they":[578,583],"differ":[579],"way":[582,655],"modularize":[584],"coefficients":[586,649,710],"constrained":[590],"introduce":[593],"variant":[596],"these":[600],"methods,":[601],"procedure":[606,623],"(Balas":[607],"Jeroslow,":[609],"1980),":[610],"paradox":[614],"sometimes":[616],"weakening":[617],"disjunction":[619],"helps":[620],"sharper":[627],"cuts.":[628],"derive":[631],"any":[642],"terms.":[645],"defines":[647],"takes":[657],"advantage":[658],"option":[661],"adding":[663],"terms":[665],"disjunction.":[668],"then":[670],"specialize":[671],"particular":[681],"tableau.":[696],"conditions":[702],"have":[708],"stronger":[709],"obtained":[714],"either":[716],"currently":[720],"procedures.":[723]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}