The integral basis method for integer programming
From MaRDI portal
Recommendations
- Iterated Chvátal-Gomory cuts and the geometry of numbers
- A primal all-integer algorithm based on irreducible solutions
- A heuristic algorithm for solving integer linear programming problem and unveiling the applications
- An algorithm for mixed integer optimization
- A new algebraic geometry algorithm for integer programming
Cited in
(15)- A primal all-integer algorithm based on irreducible solutions
- A heuristic algorithm for solving integer linear programming problem and unveiling the applications
- Non-standard approaches to integer programming
- Integral simplex using decomposition for the set partitioning problem
- Improved integral simplex using decomposition for the set partitioning problem
- Quaternary hyperplane branching with internally generated cutting planes for solving integer programmes
- Integral simplex using double decomposition for set partitioning problems
- A new algebraic geometry algorithm for integer programming
- Improving set partitioning problem solutions by zooming around an improving direction
- An integral transformation for integer programming problems
- An integer linear programming approach for a class of bilinear integer programs
- A class of integer linear fractional bilevel programming problems
- Iterated Chvátal-Gomory cuts and the geometry of numbers
- An algorithm for mixed integer optimization
- Manifold relaxations for integer programming
This page was built for publication: The integral basis method for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396977)
