Local decomposition methods for linear programming
From MaRDI portal
Recommendations
- An efficient decomposition method for linear programming problems
- On the parallel use of the decomposition method in a pair of dual problems of linear programming
- On the decomposition of linear programming problems with connecting constraints and variables
- An Implementation Of The Dual Local Decomposition Method
- scientific article; zbMATH DE number 3858840
Cites work
- scientific article; zbMATH DE number 3819432 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3402327 (Why is no real title available?)
- A dual decomposition method for block-diagonal linear programs
- Decomposition of Linear Programs by Direct Distribution
- Experiences in Using a Decomposition Program
- Partitioning procedures for solving mixed-variables programming problems
- The Decomposition Algorithm for Linear Programs
Cited in
(16)- Efficient implementation of the localized orthogonal decomposition method
- Decomposition and iterative aggregation in hierarchical and decentralised planning structures
- scientific article; zbMATH DE number 4023014 (Why is no real title available?)
- A decomposition method in linear programming.
- An Implementation Of The Dual Local Decomposition Method
- scientific article; zbMATH DE number 4139478 (Why is no real title available?)
- On the decomposition of linear programming problems with connecting constraints and variables
- Aggregation and decomposition for multi-divisional linear programs
- Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework
- Méthodes de décomposition et décentralisation en programmation linéaire
- scientific article; zbMATH DE number 3856807 (Why is no real title available?)
- scientific article; zbMATH DE number 3858840 (Why is no real title available?)
- An efficient decomposition method for linear programming problems
- Dynamic decomposition method for linear programming problems with ceneralized upper bounds
- scientific article; zbMATH DE number 4149896 (Why is no real title available?)
- A Parametric Subproblem for Dual Methods in Decomposition
This page was built for publication: Local decomposition methods for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091939)