{"id":"https://openalex.org/W1970192980","doi":"https://doi.org/10.21236/ada204662","title":"A Parallel Decomposition Algorithm for Staircase Linear Programs","display_name":"A Parallel Decomposition Algorithm for Staircase Linear Programs","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W1970192980","doi":"https://doi.org/10.21236/ada204662","mag":"1970192980"},"language":"en","primary_location":{"id":"doi:10.21236/ada204662","doi":"https://doi.org/10.21236/ada204662","is_oa":false,"landing_page_url":"https://doi.org/10.21236/ada204662","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"},"volume":null,"type":"report","is_traditional":false,"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/A5018545018","display_name":"Robert Entriken","orcid":"https://orcid.org/0009-0001-6715-0893","observed_orcids":["https://orcid.org/0009-0001-6715-0893"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert Entriken","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5018545018"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"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.8579000234603882,"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.8579000234603882,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.07590000331401825,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.026000000536441803,"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/parallel-decomposition","display_name":"parallel decomposition","score":0.875},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8830000162124634},{"id":"https://openalex.org/keywords/message-passing","display_name":"message passing","score":0.6209999918937683},{"id":"https://openalex.org/keywords/shared-memory-multiprocessors","display_name":"shared-memory multiprocessors","score":0.9139999747276306},{"id":"https://openalex.org/keywords/distributed-memory-parallel-computers","display_name":"distributed memory parallel computers","score":0.7289999723434448},{"id":"https://openalex.org/keywords/minos","display_name":"MINOS","score":0.6840000152587891},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.5609999895095825},{"id":"https://openalex.org/keywords/planning-challenges","display_name":"planning problems","score":0.8209999799728394}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6407129168510437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.54638671875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5017373561859131},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46273741126060486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32147541642189026},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.1125471293926239},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21236/ada204662","doi":"https://doi.org/10.21236/ada204662","is_oa":false,"landing_page_url":"https://doi.org/10.21236/ada204662","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"}],"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/W2061629774","https://openalex.org/W2402408335","https://openalex.org/W4245143661","https://openalex.org/W4232576638","https://openalex.org/W1969798532","https://openalex.org/W2120400038","https://openalex.org/W4231095846","https://openalex.org/W2084805084","https://openalex.org/W132973397","https://openalex.org/W2074850573"],"abstract_inverted_index":{"Abstract":[0],":":[1],"As":[2],"part":[3],"of":[4,13,29,35,59,69,113],"an":[5,79],"extended":[6],"research":[7],"project":[8],"on":[9,96],"the":[10,111,114,124],"parallel":[11,17,100,125],"decomposition":[12,126,170],"linear":[14],"programs,":[15],"a":[16,32,52,61,82,146,152,176],"algorithm":[18,89,127],"for":[19,81,148,159],"Staircase":[20],"Linear":[21],"Programs":[22],"was":[23],"designed":[24],"and":[25,38,45,117,150],"implemented.":[26],"This":[27,48],"class":[28],"problems":[30,37],"encompasses":[31],"large":[33],"range":[34],"planning":[36,105],"when":[39],"decomposed":[40],"has":[41],"simple":[42,103],"subproblem":[43,154],"formulations":[44],"communication":[46],"patterns.":[47],"makes":[49],"its":[50],"solution":[51],"manageable":[53],"step":[54],"toward":[55],"our":[56],"eventual":[57],"goal":[58],"producing":[60],"general":[62],"code":[63,139],"that":[64,169],"automatically":[65],"exploits":[66],"problem":[67,106,164],"structures":[68],"various":[70],"forms.":[71],"The":[72,88,136,156,166],"results":[73,167],"presented":[74],"here":[75],"were":[76],"derived":[77],"from":[78],"implementation":[80],"Sequent":[83],"Balance":[84],"8000":[85],"shared-memory":[86],"multiprocessor.":[87],"itself":[90],"is":[91,107,142,161],"message-based":[92],"but":[93],"can":[94,171],"run":[95],"either":[97],"shared-or":[98],"distributed-memory":[99],"computers.":[101],"A":[102],"diet":[104],"used":[108,143],"to":[109,121,131,186],"demonstrate":[110],"principles":[112],"algorithm's":[115],"development":[116],"performance.":[118],"When":[119],"applied":[120],"this":[122],"problem,":[123],"shows":[128],"promise":[129],"relative":[130],"present":[132],"serial":[133],"optimization":[134,138],"codes.":[135],"nonlinear":[137],"MINOS":[140],"5.1":[141],"both":[144],"as":[145,151],"basis":[147],"comparison":[149],"generic":[153],"solver.":[155],"greatest":[157],"room":[158],"speedup":[160],"in":[162],"exploiting":[163],"structures.":[165],"show":[168],"improve":[172],"efficiency":[173],"even":[174],"with":[175],"single":[177],"processor.":[178],"Examples":[179],"are":[180],"given":[181],"where":[182],"multiple":[183],"processors":[184],"lead":[185],"greater":[187],"efficiency.":[188]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}