A clustering heuristic to detect staircase structures in large scale linear programming models

DOI10.1016/0377-2217(94)90019-1zbMath0804.90089OpenAlexW2083393478MaRDI QIDQ1331570

Maliyakal D. Jayakumar, Ranga V. Ramasesh

Publication date: 19 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90019-1

zbMATH Keywords

decompositionheuristic algorithmrectangular matriceslarge scale linear programsrank order clustering procedurestaircase structure

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items (1)

Consistency Cuts for Dantzig-Wolfe Reformulations

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of an available set of linear programming test problems
• Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
• A Forward Simplex Method for Staircase Linear Programs
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• Solving staircase linear programs by the simplex method, 1: Inversion
• An Algorithm for Large Set Partitioning Problems
• Computing the block triangular form of a sparse matrix
• Solving staircase linear programs by the simplex method, 2: Pricing

This page was built for publication: A clustering heuristic to detect staircase structures in large scale linear programming models