The following pages link to MOPS (Q20791):
Displaying 19 items.
- A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases (Q819123) (← links)
- Mathematical models and solution methods for optimal container terminal yard layouts (Q989631) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- A fast LU update for linear programming (Q1309856) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- A hybrid algorithm for solving network flow problems with side constraints. (Q1406684) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- A time-space network based exact optimization model for multi-depot bus scheduling (Q2433529) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- (Q2759907) (← links)
- (Q3416573) (← links)
- (Q3525413) (← links)
- (Q3837878) (← links)
- A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP (Q4229462) (← links)
- (Q4347846) (← links)
- (Q4382667) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- Strengthening Gomory Mixed-Integer Cuts (Q5392100) (← links)
