{"id":"https://openalex.org/W2274651027","doi":null,"title":"A constructive primal-dual cutting-plane algorithm for all-integer programming","display_name":"A constructive primal-dual cutting-plane algorithm for all-integer programming","publication_year":1980,"publication_date":"1980-01-01","ids":{"openalex":"https://openalex.org/W2274651027","mag":"2274651027"},"language":"en","primary_location":{"id":"pmh:oai:ttu-ir.tdl.org:2346/19327","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/2346/19327","pdf_url":null,"source":{"id":"https://openalex.org/S4306402519","display_name":"ThinkTech (Texas Tech University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I12315562","host_organization_name":"Texas Tech University","host_organization_lineage":["https://openalex.org/I12315562"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5020627621","display_name":"Parviz Ghandforoush","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Parviz Ghandforoush","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5020627621"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"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.5996000170707703,"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.5996000170707703,"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.2865999937057495,"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.1005999967455864,"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.6600000262260437},{"id":"https://openalex.org/keywords/primal-dual-algorithm","display_name":"primal-dual algorithm","score":0.7680000066757202},{"id":"https://openalex.org/keywords/degenerate-problems","display_name":"degenerate problems","score":0.5419999957084656},{"id":"https://openalex.org/keywords/fixed-charge-problem","display_name":"fixed charge problem","score":0.9380000233650208},{"id":"https://openalex.org/keywords/allocation-problems","display_name":"allocation problems","score":0.6060000061988831},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.5170000195503235},{"id":"https://openalex.org/keywords/pivot-selection","display_name":"pivot selection","score":0.41499999165534973},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.33500000834465027},{"id":"https://openalex.org/keywords/artificial-variables","display_name":"artificial variables","score":0.421999990940094}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.8251285552978516},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.664824903011322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6366167664527893},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6181991696357727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.603776216506958},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5800591111183167},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5475968718528748},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4818500280380249},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41035377979278564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40435999631881714},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3668482303619385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2540895938873291},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ttu-ir.tdl.org:2346/19327","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/2346/19327","pdf_url":null,"source":{"id":"https://openalex.org/S4306402519","display_name":"ThinkTech (Texas Tech University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I12315562","host_organization_name":"Texas Tech University","host_organization_lineage":["https://openalex.org/I12315562"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:2274651027","doi":null,"is_oa":false,"landing_page_url":"https://ttu-ir.tdl.org/handle/2346/19327","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":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1980384444","https://openalex.org/W2009683816","https://openalex.org/W2058418502","https://openalex.org/W2100890245","https://openalex.org/W2152939132","https://openalex.org/W2166136730","https://openalex.org/W2166628180","https://openalex.org/W2336259629"],"related_works":["https://openalex.org/W2041621614","https://openalex.org/W1983132195","https://openalex.org/W2045076853","https://openalex.org/W2126369429","https://openalex.org/W6974540292","https://openalex.org/W7110531885","https://openalex.org/W2038141985","https://openalex.org/W2046083089","https://openalex.org/W1981191225","https://openalex.org/W659186951"],"abstract_inverted_index":{"This":[0,141],"dissertation":[1,427],"presents":[2],"a":[3,17,25,33,67,71,97,100,116,136,151,196,322,343,367,392,469,491],"new":[4,92],"hybrid":[5],"cutting-plane":[6],"algorithm":[7,21,131,382],"for":[8,161,355,384,478],"solving":[9,294],"all-integer":[10,19,40,46],"integer":[11,178,230,334,419,455,482],"linear":[12],"programming":[13,20,335,420],"problems.":[14,300,352,496],"CPDA":[15,59,84,158,290,307,337,362,410,434,485],"is":[16,74,103,132,139,148,156,159,363,366,449,475],"primal-dual-based,":[18],"which":[22,213,380],"alternates":[23],"between":[24],"primal-feasible":[26,137,145],"stage":[418],"related":[28,36],"to":[29,37,50,58,146,309,339,487],"Young's":[30],"SPA,":[31],"and":[32,188,255,271,297,315,349,387],"dual-infeasible":[34],"Gomory's":[38],"dual":[39,223],"algorithm.\r\nCPDA":[41],"starts":[42],"with":[43,281,437],"an":[44,303,454],"initial":[45],"primal":[47,166,208],"tableau":[48,118,138],"similar":[49],"SPA.":[51],"The":[52],"ordinary":[53],"simplex":[54],"rules":[55],"are":[56,373],"applied":[57],"as":[60,62,444],"long":[61],"each":[63],"iteration":[64],"results":[65],"in":[66,95,108,199,263,293,321,375,379,398],"transition":[68],"cycle.":[69],"If":[70],"stationary":[72,101,217],"cycle":[73,102],"encountered":[75],"at":[76,119],"any":[77],"of":[79,129,144,176,191,216,228,325,330,333,345,396,414,432,481,493],"the":[80,83,87,91,109,120,126,130,174,177,189,225,229,249,265,278,318,328,381,400,409,415,429,433],"solution":[81,155,320,329],"process,":[82],"departs":[85],"from":[86,411,425],"SPA":[88],"by":[89,244,361,461],"selecting":[90],"pivot":[93],"row":[94,111],"such":[96,192],"way":[98],"that":[99,364],"avoided.":[104],"Obviously,":[105],"this":[106,124,242,356,404,426],"change":[107],"source":[110],"selection":[112],"process":[113,143],"will":[114],"produce":[115,260],"primal-infeasible":[117,147],"next":[121],"iteration.":[122],"At":[123],"point":[125],"second":[127],"implemented,":[133],"continuing":[134],"until":[135,150],"obtained.":[140],"alternating":[142],"repeated":[149],"final":[152,401],"feasible":[153],"optimal":[154,319],"reached.\r\nThe":[157],"appealing":[160],"several":[162,413],"reasons:":[163],"(a)":[164,446],"In":[165,220],"algorithms,":[167,224],"artificial":[168],"variables":[169,193],"must":[170,232,238,267],"be":[171,239,268,442,458],"incorporated":[172],"when":[173],"constraints":[175],"problem":[179,231,456],"include":[180,233],"some":[181,282],"or":[182,185,237],"all":[183,221,479],">":[184,283],"=":[186,285],"constraints,":[187],"presence":[190],"usually":[194],"causes":[195],"dramatic":[197],"increase":[198],"computational":[200,288,430],"effort;":[201],"(b)":[202,452],"For":[203],"heavily":[204],"degenerate":[205,313],"problems,":[206,336,483],"existing":[207,416],"algorithms":[209,254],"sometimes":[210],"encounter":[211],"cycles":[212],"involve":[214],"thousands":[215],"iterations;":[218],"(c)":[219],"current":[222],"objective":[226,304],"function":[227,305],"only":[234,276],"positive":[235],"coefficients,":[236],"transformed":[240],"into":[241],"form":[243],"finding":[245],"upper":[246],"bounds":[247],"on":[248,342,490],"associated":[250],"variables;":[251],"(d)":[252],"Dual":[253],"Glover's":[256,273],"PPDA":[257,274],"do":[258],"not":[259,407],"good/useful":[261],"solutions":[262],"case":[264],"computation":[266],"stopped":[269],"prematurely;":[270],"(e)":[272],"can":[275],"solve":[277],"minimization":[279],"problems":[280,372],"and/or":[284],"constraints.\r\nAs":[286],"regards":[287],"efficiency,":[289],"performed":[291],"well":[292,489],"highly":[295],"primal-":[296],"dual-degenerate":[298],"fixed-charge":[299,495],"By":[301],"incorporating":[302],"cut,":[306],"manages":[308],"delete":[310],"many":[311],"primal-dual":[312,368],"iterations,":[314],"eventually":[316],"reaches":[317],"small":[323],"number":[324,395],"iterations.":[326],"Concerning":[327],"other":[331,438],"cases":[332],"appears":[338,486],"perform":[340,488],"consistently":[341],"set":[344,492],"specially":[346],"designed":[347],"allocation":[348],"IBM":[350],"test":[351],"One":[353],"reason":[354],"less":[357],"than":[358],"outstanding":[359],"performance":[360],"it":[365],"algorithm.":[369],"That":[370],"is,":[371],"solved":[374,460],"two":[376],"distinct":[377],"stages":[378],"searches":[383],"both":[385],"optimality":[386],"feasibility":[388],"conditions,":[389],"thus":[390],"requiring":[391],"relatively":[393],"larger":[394],"iterations":[397],"reaching":[399],"solution.":[402],"However,":[403],"situation":[405],"does":[406],"prevent":[408],"outperforming":[412],"one":[462,473],"algorithms.\r\nThe":[421],"general":[422],"conclusion":[423],"drawn":[424],"regarding":[428],"efficiency":[431],"(in":[435],"comparison":[436],"IP":[439,463],"algorithms)":[440],"may":[441,457,467],"summarized":[443],"follows:":[445],"Computation":[447],"time":[448],"code":[450,466,474],"dependent;":[451],"Although":[453],"easily":[459],"code,":[464],"another":[465],"prove":[468],"complete":[470],"failure.":[471],"No":[472],"uniformly":[476],"better":[477],"types":[480],"although":[484],"difficult":[494]},"counts_by_year":[],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}