A clustering heuristic to detect staircase structures in large scale linear programming models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3668319 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Forward Simplex Method for Staircase Linear Programs
- An Algorithm for Large Set Partitioning Problems
- An analysis of an available set of linear programming test problems
- Computing the block triangular form of a sparse matrix
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Evaluation of Orderings for Unsymmetric Sparse Matrices
- Solving staircase linear programs by the simplex method, 1: Inversion
- Solving staircase linear programs by the simplex method, 2: Pricing
Cited in
(6)- Consistency cuts for Dantzig-Wolfe reformulations
- Cascading-heuristics for the solution of staircase linear programs
- A method for decomposing mixed-integer linear programs with staircase structure
- Staircase Matrices and Systems
- scientific article; zbMATH DE number 3856811 (Why is no real title available?)
- On recognizing staircase compatibility
This page was built for publication: A clustering heuristic to detect staircase structures in large scale linear programming models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331570)