Pages that link to "Item:Q3320128"
From MaRDI portal
The following pages link to A primal-dual cutting-plane algorithm for all-integer programming (Q3320128):
Displaying 12 items.
- An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472) (← links)
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems (Q1085064) (← links)
- An advanced start algorithm for all-integer programming (Q1086158) (← links)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- The mixed cutting plane algorithm for all-integer programming (Q1092815) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- New technique for solving primal all-integer linear programming (Q1393023) (← links)
- Primal cutting plane algorithms revisited (Q1396918) (← links)
- A primal all-integer algorithm based on irreducible solutions (Q1424268) (← links)
- Primal-dual simplex method for shooting (Q2883641) (← links)
- A bounded dual (all-integer) integer programming algorithm with an objective cut (Q3316963) (← links)