On the public citation graph
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
0 signed · 89 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/978-1-4615-8675-3openalex-snapshot
Sparse Matrices and their Applications
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_4openalex-snapshot
Some Basic Techniques for Solving Sparse Systems of Linear Equations
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_6openalex-snapshot
The Partitioned Preassigned Pivot Procedure (P4)
inferredcites →https://doi.org/10.1007/bf01580108openalex-snapshot
Pivot selection methods of the Devex LP code
inferredcites →https://doi.org/10.1007/bf01584344openalex-snapshot
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
inferredcites →https://doi.org/10.1007/bf01584548openalex-snapshot
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
inferredcites →https://doi.org/10.1007/bfb0120710openalex-snapshot
Pivot selection methods of the Devex LP code
inferredcites →https://doi.org/10.1016/0047-2727(73)90031-5openalex-snapshot
Multi-level planning: Case studies in Mexico
inferredcites →https://doi.org/10.1016/b978-0-12-358350-5.50004-xopenalex-snapshot
On the Need for a System Optimization Laboratory
inferredcites →https://doi.org/10.1057/jors.1968.83openalex-snapshot
Décomposition des Programmes Mathématiques
inferredcites →https://doi.org/10.1057/jors.1974.102openalex-snapshot
A Structured Linear Programming Model in the Food Industry
inferredcites →https://doi.org/10.1057/jors.1975.161openalex-snapshot
Optimization Methods for Resource Allocation.
inferredcites →https://doi.org/10.1093/comjnl/12.3.232openalex-snapshot
Advanced Linear-Programming Computing Techniques
inferredcites →https://doi.org/10.1093/comjnl/8.1.13openalex-snapshot
Experiences in Using a Decomposition Program
inferredcites →https://doi.org/10.1109/tsmc.1971.4308301openalex-snapshot
Optimization Theory of Large Systems
inferredcites →https://doi.org/10.1145/355873.355875openalex-snapshot
A Comparative Study of Two Methods for Staircase Linear Programs
inferredcites →https://doi.org/10.1145/800184.810500openalex-snapshot
Aspects of large-scale in-core linear programming
inferredcites →https://doi.org/10.1147/sj.171.0064openalex-snapshot
The Extended Control Language of MPSX/370 and possible applications
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.1515/9781400884179-024openalex-snapshot
23. A Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.2307/1911818openalex-snapshot
The Decomposition Algorithm for 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/978-1-4471-4057-3_2openalex-snapshot
Research Background and Literature Review
inferred← citeshttps://doi.org/10.1007/978-3-031-81253-8_6openalex-snapshot
An Integer Linear Programming Model for Earth Observation Missions
inferred← citeshttps://doi.org/10.1007/978-3-642-02833-5_3openalex-snapshot
Coordination Mechanisms for Supply Chain Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf01581138openalex-snapshot
Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
inferred← citeshttps://doi.org/10.1007/bf01585159openalex-snapshot
Load balancing in the parallel optimization of block-angular linear programs
inferred← citeshttps://doi.org/10.1007/bf01589413openalex-snapshot
Decomposition of linear programs using parallel computation
inferred← citeshttps://doi.org/10.1007/bf02023045openalex-snapshot
Parallel processors for planning under uncertainty
inferred← citeshttps://doi.org/10.1007/bf02023050openalex-snapshot
Parallel bundle-based decomposition for large-scale structured mathematical programming problems
inferred← citeshttps://doi.org/10.1007/bf02186471openalex-snapshot
Planning under uncertainty using parallel computing
inferred← citeshttps://doi.org/10.1007/bf02192181openalex-snapshot
Generalized proximal point algorithm for convex optimization
inferred← citeshttps://doi.org/10.1007/bf02591904openalex-snapshot
Computational experience with advanced implementation of decomposition algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/bf02592950openalex-snapshot
Revised dantzig-wolfe decomposition for staircase-structured linear programs
inferred← citeshttps://doi.org/10.1007/bfb0006875openalex-snapshot
On the use of nested decomposition for solving nonlinear multistage stochastic programs
inferred← citeshttps://doi.org/10.1007/bfb0121182openalex-snapshot
Recent advances in the decomposition approach to linear programming
inferred← citeshttps://doi.org/10.1007/s100120200018openalex-snapshot
The Existence of Optimal Solutions for a Kind of Large-Scale Goal Proramming
inferred← citeshttps://doi.org/10.1007/s11590-012-0546-9openalex-snapshot
Converging upon basic feasible solutions through Dantzig–Wolfe decomposition
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80003-9openalex-snapshot
Large scale mathematical programming systems
inferred← citeshttps://doi.org/10.1016/0167-6377(84)90048-8openalex-snapshot
Convergence behavior of decomposition algorithms for linear programs
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90199-0openalex-snapshot
A heuristic decomposition approach to optimal control in a water supply model
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0246-topenalex-snapshot
A fuzzy satisficing method for large-scale linear programming problems with block angular structure
inferred← citeshttps://doi.org/10.1016/j.amc.2003.12.087openalex-snapshot
Extensions of TOPSIS for multi-objective large-scale nonlinear programming problems
inferred← citeshttps://doi.org/10.1016/j.amc.2005.11.030openalex-snapshot
An interactive algorithm for large scale multiple objective programming problems with fuzzy parameters through TOPSIS approach
inferred← citeshttps://doi.org/10.1016/j.cor.2008.10.002openalex-snapshot
Dantzig–Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.01.017openalex-snapshot
Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings
inferred← citeshttps://doi.org/10.1016/j.fss.2015.09.020openalex-snapshot
Branch-and-price algorithm for fuzzy integer programming problems with block angular structure
inferred← citeshttps://doi.org/10.1016/s0165-0114(98)00452-7openalex-snapshot
An interactive fuzzy satisficing method for multiobjective block angular linear programming problems with fuzzy parameters
inferred← citeshttps://doi.org/10.1016/s0165-1889(03)00053-8openalex-snapshot
Computing solutions to moral-hazard programs using the Dantzig–Wolfe decomposition algorithm
inferred← citeshttps://doi.org/10.1016/s0294-1449(17)30033-1openalex-snapshot
Bundle-Based Decomposition: Conditions for Convergence
inferred← citeshttps://doi.org/10.1023/b:josh.0000014068.89991.c4openalex-snapshot
Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig–Wolfe Decomposition
inferred← citeshttps://doi.org/10.1051/ro/1984180404031openalex-snapshot
Computational aspects of DYNAMICO : a model of trade and development in the world economy
inferred← citeshttps://doi.org/10.1051/ro/1986200402871openalex-snapshot
Méthodes de décomposition et décentralisation en programmation linéaire
inferred← citeshttps://doi.org/10.1051/ro/2010011openalex-snapshot
Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems
inferred← citeshttps://doi.org/10.1057/9780230372924_10openalex-snapshot
Supply-chain Production Planning
inferred← citeshttps://doi.org/10.1057/jors.2011.62openalex-snapshot
Parallel Dantzig–Wolfe decomposition of petroleum production allocation problems
inferred← citeshttps://doi.org/10.1080/00207540802680526openalex-snapshot
A price-directed decomposition approach for solving large-scale capacitated part-routing problems
inferred← citeshttps://doi.org/10.1080/00207728308926537openalex-snapshot
A revised iterative algorithm for decomposition goal programming
inferred← citeshttps://doi.org/10.1080/01605682.2021.1940326openalex-snapshot
Decomposition approach for solving large-scale spatially disaggregated economic equilibrium problems
inferred← citeshttps://doi.org/10.1080/10556789508805610openalex-snapshot
Global function strategy in the decomposition approach
inferred← citeshttps://doi.org/10.1109/59.207322openalex-snapshot
A decomposed state estimation technique suitable for parallel processor implementation
inferred← citeshttps://doi.org/10.1109/59.466518openalex-snapshot
Distributed price-directive decomposition applications in power systems operations
inferred← citeshttps://doi.org/10.1109/59.54549openalex-snapshot
Linear reactive power optimization in a large power network using the decomposition approach
inferred← citeshttps://doi.org/10.1109/kes.1998.725830openalex-snapshot
Efficiency of a decomposition method for large-scale multiobjective fuzzy linear programming problems with block angular structure
inferred← citeshttps://doi.org/10.1109/tpas.1982.317035openalex-snapshot
A Decomposition Approach to the Economic Dispatch of Hydrothermal Systems
inferred← citeshttps://doi.org/10.1109/tsg.2016.2614768openalex-snapshot
Decentralized Coordination of a Building Manager and an Electric Vehicle Aggregator
inferred← citeshttps://doi.org/10.1109/tsmcb.2003.811126openalex-snapshot
Genetic algorithms with decomposition procedures for multidimensional 0-1 knapsack problems with block angular structures
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00774.xopenalex-snapshot
Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
inferred← citeshttps://doi.org/10.1115/1.2793874openalex-snapshot
A Revised Decomposition Method for MILP Problems and Its Application to Operational Planning of Thermal Storage Systems
inferred← citeshttps://doi.org/10.1137/s1052623494253286openalex-snapshot
Parallel Decomposition: Results for Staircase Linear Programs
inferred← citeshttps://doi.org/10.1287/ijoc.11.4.370openalex-snapshot
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
inferred← citeshttps://doi.org/10.1287/moor.11.4.644openalex-snapshot
A Parametric Subproblem for Dual Methods in Decomposition
inferred← citeshttps://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems
inferred← citeshttps://doi.org/10.14569/ijacsa.2024.01507113openalex-snapshot
Modification of the Danzig-Wolf Decomposition Method for Building Hierarchical Intelligent Systems
inferred← citeshttps://doi.org/10.21236/ada216100openalex-snapshot
The Parallel of Decomposition of Linear Programs
inferred← citeshttps://doi.org/10.2139/ssrn.5233164openalex-snapshot
A Lagrangian Approach to Optimal Lotteries in Non-Convex Economies
inferred← citeshttps://doi.org/10.2514/1.45606openalex-snapshot
Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling
inferred← citeshttps://doi.org/10.2514/6.2009-6009openalex-snapshot
Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling
inferred← citeshttps://doi.org/10.26021/5459openalex-snapshot
Optimization of Production Planning for a Quota-Based Integrated Commercial Fishery
inferred← citeshttps://doi.org/10.3156/jfuzzy.9.5_747openalex-snapshot
Efficiency of a Decomposition Method for Large-Scale Multiobjective Fuzzy Linear Programming Problems with Block Angular Structure
inferred← citeshttps://doi.org/10.3233/inf-1996-7304openalex-snapshot
On the degree of decomposition in linear programming
inferred← citeshttps://doi.org/10.5772/12927openalex-snapshot
Linear Programming Formulation of the Multi-Depot Multiple Traveling Salesman Problem with Differentiated Travel Costs
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.