On the public citation graph
Load balancing in the parallel optimization of block-angular linear programs
0 signed · 26 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01589355openalex-snapshot
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf01589413openalex-snapshot
Decomposition of linear programs using parallel computation
inferredcites →https://doi.org/10.1007/bf02023046openalex-snapshot
Parallel solution of large-scale, block-angular linear programs
inferredcites →https://doi.org/10.1007/bf02023050openalex-snapshot
Parallel bundle-based decomposition for large-scale structured mathematical programming problems
inferredcites →https://doi.org/10.1007/bf02591904openalex-snapshot
Computational experience with advanced implementation of decomposition algorithms for linear programming
inferredcites →https://doi.org/10.1016/0377-2217(90)90023-5openalex-snapshot
DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferredcites →https://doi.org/10.1051/ro/1984180404031openalex-snapshot
Computational aspects of DYNAMICO : a model of trade and development in the world economy
inferredcites →https://doi.org/10.1109/tse.1987.233513openalex-snapshot
The Crystal Multicomputer: Design and Implementation Experience
inferredcites →https://doi.org/10.1145/1465482.1465560openalex-snapshot
Validity of the single processor approach to achieving large scale computing capabilities
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.1515/9781400884179-024openalex-snapshot
23. A Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.5860/choice.26-0975openalex-snapshot
Computer solution of linear programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0220openalex-snapshot
D antzig– W olfe Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-60902-4_50openalex-snapshot
Decomposing linear programs for parallel solution
inferred← citeshttps://doi.org/10.1007/3-540-62095-8_64openalex-snapshot
An effective model to decompose Linear Programs for parallel solution
inferred← citeshttps://doi.org/10.1007/bf01299209openalex-snapshot
On the efficacy of distributed simplex algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/s10287-008-0080-5openalex-snapshot
Towards a practical parallelisation of the simplex method
inferred← citeshttps://doi.org/10.1016/j.dss.2005.11.008openalex-snapshot
Alternative model representations and computing capacity: Implications for model management
inferred← citeshttps://doi.org/10.1016/j.jprocont.2010.06.003openalex-snapshot
Parallel Dantzig–Wolfe decomposition for real-time optimization—Applied to a complex oil field
inferred← citeshttps://doi.org/10.1057/jors.2011.62openalex-snapshot
Parallel Dantzig–Wolfe decomposition of petroleum production allocation problems
inferred← citeshttps://doi.org/10.1109/59.466518openalex-snapshot
Distributed price-directive decomposition applications in power systems operations
inferred← citeshttps://doi.org/10.1137/s1064827502401953openalex-snapshot
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
inferred← citeshttps://doi.org/10.1145/264029.264031openalex-snapshot
Distributed nested decomposition of staircase linear programs
inferred← citeshttps://doi.org/10.1287/ijoc.15.4.369.24887openalex-snapshot
Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.