MOPS
From MaRDI portal
MOPS Q20791
swMATH8791MaRDI QIDQ20791FDOQ20791
Author name not available (Why is that?)
Official website: http://www.maximalsoftware.com/solvers/MOPS.html
Cited In (21)
- A time-space network based exact optimization model for multi-depot bus scheduling
- Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
- A fast LU update for linear programming
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Strengthening Gomory Mixed-Integer Cuts
- Title not available (Why is that?)
- A hybrid algorithm for solving network flow problems with side constraints.
- Title not available (Why is that?)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- DEVEX
- Dsor
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases
- A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP
- Title not available (Why is that?)
- Supernode processing of mixed-integer models
- Title not available (Why is that?)
- Line change considerations within a time-space network based multi-depot bus scheduling model
- Mathematical models and solution methods for optimal container terminal yard layouts
This page was built for software: MOPS
