Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
From MaRDI portal
Recommendations
- Creating advanced bases for large scale linear programs exploiting embedded network structure
- scientific article; zbMATH DE number 3852786
- scientific article; zbMATH DE number 966292
- New crash procedures for large systems of linear constraints
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
Cited in
(14)- Modelling and analysis of multistage stochastic programming problems: A software environment
- Advances in design and implementation of optimization software
- A two-phase support method for solving linear programs: numerical experiments
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Crash start of interior point methods
- scientific article; zbMATH DE number 3852786 (Why is no real title available?)
- scientific article; zbMATH DE number 4095202 (Why is no real title available?)
- LPAKO: A Simplex-based Linear Programming Program
- scientific article; zbMATH DE number 966292 (Why is no real title available?)
- New crash procedures for large systems of linear constraints
- Creating advanced bases for large scale linear programs exploiting embedded network structure
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
- Computational study of the GDPO dual phase-1 algorithm
This page was built for publication: Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427345)
