{"id":"https://openalex.org/W1576434005","doi":null,"title":"Integer Programs with Block Structure","display_name":"Integer Programs with Block Structure","alternate_titles":[],"publication_year":1999,"publication_date":"1999-02-22","ids":{"openalex":"https://openalex.org/W1576434005","mag":"1576434005"},"language":"en","primary_location":{"id":"mag:1576434005","doi":null,"is_oa":false,"landing_page_url":"https://opus4.kobv.de/opus4-zib/files/391/SC-99-03.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},"parent_works":[],"lineage":["https://openalex.org/W1576434005"],"child_works_count":0,"type":"article","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/A5006197528","display_name":"Alexander Reid Martin","orcid":"https://orcid.org/0000-0001-7602-3653","observed_orcids":["https://orcid.org/0000-0001-7602-3653"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Mart\u00edn","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7602-3653","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5006197528"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9448,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.82259018,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7440999746322632,"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.7440999746322632,"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.21860000491142273,"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.006599999964237213,"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/integer-programming","display_name":"integer programming","score":0.871999979019165},{"id":"https://openalex.org/keywords/block-structure","display_name":"block structure","score":0.968999981880188},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"decomposition method","score":0.6859999895095825},{"id":"https://openalex.org/keywords/polyhedral-analysis","display_name":"polyhedral analysis","score":0.8629999756813049},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"branch-and-cut","score":0.9139999747276306},{"id":"https://openalex.org/keywords/cutting-planes","display_name":"cutting planes","score":0.6959999799728394},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.7379999756813049},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7310000061988831},{"id":"https://openalex.org/keywords/dual-simplex-algorithm","display_name":"dual simplex algorithm","score":0.7979999780654907},{"id":"https://openalex.org/keywords/parallelization","display_name":"parallelization","score":0.7620000243186951},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":0.7360000014305115},{"id":"https://openalex.org/keywords/circuit-design","display_name":"circuit design","score":0.8960000276565552},{"id":"https://openalex.org/keywords/production-planning","display_name":"production planning","score":0.8999999761581421}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.692138671875},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6284928917884827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5391926765441895},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5180609226226807},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5104862451553345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45890703797340393},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.45625078678131104},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.445004940032959},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4323447048664093},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.430231511592865},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4060558080673218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3817341923713684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.348507821559906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12218251824378967},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09280279278755188},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1576434005","doi":null,"is_oa":false,"landing_page_url":"https://opus4.kobv.de/opus4-zib/files/391/SC-99-03.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":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2487227191","https://openalex.org/W2963126600","https://openalex.org/W3046255848","https://openalex.org/W2045734922","https://openalex.org/W4399801021","https://openalex.org/W4398180156","https://openalex.org/W2946874069","https://openalex.org/W2894550935","https://openalex.org/W2052336185","https://openalex.org/W1552381123"],"abstract_inverted_index":{"In":[0,143,335,364],"this":[1],"thesis":[2,253],"we":[3,146,338,367],"study":[4],"and":[5,40,93,129,132,160,173,185,215,228,235,310,377],"solve":[6,137,242],"integer":[7,73,154,258,263,293,303,333,386,413],"programs":[8,51,74,264,304,359],"with":[9,34,52,75,246,255,265,394],"block":[10,53,76,247,308,329],"structure,":[11],"i.\\,e.,":[12],"problems":[13],"that":[14,67,114,191,261,348,383,404],"after":[15],"the":[16,24,41,86,91,127,138,153,162,166,170,175,179,188,208,233,238,252,270,279,289,299,328,342,346,353,356,374,385,395,408,411],"removal":[17],"of":[18,23,178,187,201,210,225,237,251,282,291,331,341,355,397,410],"certain":[19,307],"rows":[20,42],"(or":[21],"columns)":[22],"constraint":[25,271,375],"matrix":[26,376],"decompose":[27,305],"into":[28,111,193,306],"independent":[29,112],"subproblems.":[30],"The":[31,65,81,104,183,204,321],"matrices":[32],"associated":[33,171,393],"each":[35,224],"subproblem":[36],"are":[37,68,78],"called":[38,101],"blocks":[39,372],"(columns)":[43],"to":[44,71,84,136,141,241,316,369,378],"be":[45,117,392],"removed":[46],"linking":[47,87,163,181],"constraints":[48,88,164],"(columns).":[49],"Integer":[50],"structure":[54,77,268,330],"come":[55,192],"up":[56],"in":[57,61,165,207,213,269,276,373,417],"a":[58,97,148,158,220,319,361],"natural":[59],"way":[60],"many":[62],"real-world":[63,202,244],"applications.":[64],"methods":[66,122],"widely":[69],"used":[70,351],"tackle":[72],"decomposition":[79],"methods.":[80],"idea":[82],"is":[83,195,262,314,349],"decouple":[85],"(variables)":[89],"from":[90],"problem":[92,108,131,140,156],"treat":[94,152],"them":[95],"at":[96],"superordinate":[98],"level,":[99],"often":[100,115],"master":[102,128],"problem.":[103],"resulting":[105],"residual":[106],"subordinate":[107,130],"then":[109,297],"decomposes":[110],"subproblems":[113],"can":[116],"solved":[118],"more":[119],"efficiently.":[120],"Decomposition":[121],"now":[123],"work":[124],"alternately":[125],"on":[126,197],"iteratively":[133],"exchange":[134],"information":[135,326],"original":[139],"optimality.":[142],"Part":[144,249],"I":[145],"follow":[147],"different":[149,199],"approach.":[150],"We":[151,168,218,273,401],"programming":[155,259,387,414],"as":[157],"whole":[159],"keep":[161],"formulation.":[167,388],"consider":[169],"polyhedra":[172],"investigate":[174,311],"polyhedral":[176,239],"consequences":[177],"involved":[180],"constraints.":[182],"variety":[184],"complexity":[186],"new":[189,380],"inequalities":[190,390],"play":[194],"illustrated":[196],"three":[198],"types":[200],"problems.":[203,400],"applications":[205],"arise":[206],"design":[209],"electronic":[211],"circuits,":[212],"telecommunication":[214],"production":[216],"planning.":[217],"develop":[219],"branch-and-cut":[221,362],"algorithm":[222,287],"for":[223,288,352],"these":[226,243],"problems,":[227,260],"our":[229],"computational":[230],"results":[231],"show":[232],"benefits":[234],"limits":[236],"approach":[240],"models":[245],"structure.":[248,320],"II":[250],"deals":[254],"general":[256,292,302,412],"mixed":[257],"no":[266],"apparent":[267],"matrix.":[272],"will":[274,402],"discuss":[275],"Chapter":[277,295,336,365,418],"5":[278],"main":[280],"ingredients":[281],"an":[283,332],"LP":[284],"based":[285],"branch-and-bound":[286],"solution":[290,354],"programs.":[294],"6":[296],"asks":[298],"question":[300],"whether":[301,312],"structures":[309],"it":[313],"possible":[315],"recognize":[317],"such":[318],"remaining":[322],"two":[323],"chapters":[324],"exploit":[325],"about":[327],"program.":[334],"7":[337],"parallelize":[339],"parts":[340],"dual":[343],"simplex":[344],"algorithm,":[345],"method":[347],"commonly":[350],"underlying":[357],"linear":[358],"within":[360],"algorithm.":[363],"8":[366],"try":[368],"detect":[370],"small":[371],"derive":[379],"cutting":[381],"planes":[382],"strengthen":[384],"These":[389],"may":[391],"intersection":[396],"several":[398],"knapsack":[399],"see":[403],"they":[405],"significantly":[406],"improve":[407],"quality":[409],"solver":[415],"introduced":[416],"5.":[419]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1576434005","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
