MOPS
From MaRDI portal
MOPS Q20791
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
- A hybrid algorithm for solving network flow problems with side constraints.
- Strengthening Gomory Mixed-Integer Cuts
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- 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
- A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP
- scientific article; zbMATH DE number 1683916 (Why is no real title available?)
- Supernode processing of mixed-integer models
- scientific article; zbMATH DE number 1183042 (Why is no real title available?)
- 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
