A relaxation algorithm for solving mixed integer programming problems
From MaRDI portal
Publication:1384441
zbMATH Open0896.90151MaRDI QIDQ1384441FDOQ1384441
Authors: Nguyen Vu Tien, Le Dung Muu 
Publication date: 12 July 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
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)
- An exponent deviation integral algorithm for mixed integer programming
- McCormick-Based Relaxations of Algorithms
- Title not available (Why is that?)
- Isometric cylinder method for strict mixed-integer linear programming
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- Exploring relaxation induced neighborhoods to improve MIP solutions
- An algorithm for mixed integer optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternative group relaxation of integer programming problems
- Manifold relaxations for integer programming
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)
