Pages that link to "Item:Q3671759"
From MaRDI portal
The following pages link to An advanced dual algorithm with constraint relaxation for all-integer programming (Q3671759):
Displaying 8 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)
- 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)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (Q1368436) (← links)
- Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
