Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
From MaRDI portal
Publication:4427345
DOI10.1287/IJOC.10.2.248zbMATH Open1034.90515OpenAlexW2109584605MaRDI QIDQ4427345FDOQ4427345
Authors: István Maros, Gautam Mitra 
Publication date: 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.10.2.248
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 (12)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Computational study of the GDPO dual phase-1 algorithm
- Modelling and analysis of multistage stochastic programming problems: A software environment
- A two-phase support method for solving linear programs: numerical experiments
- LPAKO: A Simplex-based Linear Programming Program
- Creating advanced bases for large scale linear programs exploiting embedded network structure
- Crash start of interior point methods
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- New crash procedures for large systems of linear constraints
- Title not available (Why is that?)
- Advances in design and implementation of optimization software
- Title not available (Why is that?)
Uses Software
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)
