MOPS -- Mathematical optimization system
From MaRDI portal
Publication:1317161
DOI10.1016/0377-2217(94)90312-3zbMath0800.90690OpenAlexW1983931962MaRDI QIDQ1317161
Publication date: 21 April 1994
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)90312-3
Related Items (9)
A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases ⋮ Supernode processing of mixed-integer models ⋮ Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ A hybrid algorithm for solving network flow problems with side constraints. ⋮ Simultaneous lotsizing and scheduling by combining local search with dual reoptimization ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts ⋮ Mathematical models and solution methods for optimal container terminal yard layouts ⋮ MOPS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general phase-I method in linear programming
- Finding duplicate rows in a linear programming model
- A practicable steepest-edge simplex algorithm
- Solving staircase linear programs by the simplex method, 1: Inversion
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- The Composite Simplex Algorithm
- Pivot selection methods of the Devex LP code
This page was built for publication: MOPS -- Mathematical optimization system
