All-integer linear programming — a new approach via dynamic programming
From MaRDI portal
Cited in
(4)- Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
- Parametric formulation of the general integer linear programming problem
This page was built for publication: All-integer linear programming — a new approach via dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187584)