A relaxation algorithm for solving mixed integer programming problems
From MaRDI portal
Recommendations
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- scientific article; zbMATH DE number 3972639
- scientific article; zbMATH DE number 3858858
- An algorithm for the solution of multiparametric mixed integer linear programming problems
- scientific article; zbMATH DE number 3885661
- An algorithm for mixed integer optimization
- Convex relaxations for mixed-integer nonlinear programs
- An algorithm for multiparametric mixed-integer linear programming problems
- Efficient MIP techniques for computing the relaxation complexity
- scientific article; zbMATH DE number 3614502
Cited in
(11)- Exploring relaxation induced neighborhoods to improve MIP solutions
- An algorithm for mixed integer optimization
- An exponent deviation integral algorithm for mixed integer programming
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- scientific article; zbMATH DE number 3883952 (Why is no real title available?)
- McCormick-Based Relaxations of Algorithms
- Isometric cylinder method for strict mixed-integer linear programming
- Manifold relaxations for integer programming
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- Alternative group relaxation of integer programming problems
- scientific article; zbMATH DE number 3885661 (Why is no real title available?)
This page was built for publication: A relaxation algorithm for solving mixed integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384441)