An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
From MaRDI portal
Cites work
- A Comparative Study of Two Methods for Staircase Linear Programs
- A Structured Linear Programming Model in the Food Industry
- Decomposition Principle for Linear Programs
- Experiences in Using a Decomposition Program
- scientific article; zbMATH DE number 3819432 (Why is no real title available?)
- scientific article; zbMATH DE number 3614492 (Why is no real title available?)
- scientific article; zbMATH DE number 3249567 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe
- The Decomposition Algorithm for Linear Programs
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- The elimination form of the inverse and its application to linear programming
- The Extended Control Language of MPSX/370 and possible applications
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(21)- Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
- Decomposition of linear programs using parallel computation
- A fuzzy satisficing method for large-scale linear programming problems with block angular structure
- A heuristic decomposition approach to optimal control in a water supply model
- Load balancing in the parallel optimization of block-angular linear programs
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Branch-and-price algorithm for fuzzy integer programming problems with block angular structure
- Extensions of TOPSIS for multi-objective large-scale nonlinear programming problems
- Generalized proximal point algorithm for convex optimization
- An interactive fuzzy satisficing method for multiobjective block angular linear programming problems with fuzzy parameters
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition
- An interactive algorithm for large scale multiple objective programming problems with fuzzy parameters through TOPSIS approach
- A revised iterative algorithm for decomposition goal programming
- A price-directed decomposition approach for solving large-scale capacitated part-routing problems
- Extended VIKOR as a new method for solving multiple objective large-scale nonlinear programming problems
- Computational experience with advanced implementation of decomposition algorithms for linear programming
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Convergence behavior of decomposition algorithms for linear programs
- Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings
- Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
This page was built for publication: An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922472)
