Mixed decomposition in block integer linear programming problems
From MaRDI portal
Recommendations
- Multilevel decomposition in mixed-integer block programming
- A decomposition technique for mixed integer programming problems
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- Decomposition in integer linear programming
- A relaxation algorithm for solving mixed integer programming problems
Cited in
(13)- A decomposition technique for mixed integer programming problems
- Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes
- Decomposition methods for global solution of mixed-integer linear programs
- An integer programming problem and rank decomposition of block upper triangular matrices
- Multilevel decomposition in mixed-integer block programming
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- scientific article; zbMATH DE number 647691 (Why is no real title available?)
- Decomposition Branching for Mixed Integer Programming
- Solving mixed integer classification problems by decomposition
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Decomposition and dynamic cut generation in integer linear programming
- scientific article; zbMATH DE number 2000146 (Why is no real title available?)
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
This page was built for publication: Mixed decomposition in block integer linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809891)