On the relationship between the integer and continuous solutions of convex programs
From MaRDI portal
Recommendations
- The relationship between integer and real solutions of constrained convex programming
- scientific article; zbMATH DE number 4209913
- scientific article; zbMATH DE number 826948
- On boundedness of (quasi-)convex integer optimization problems
- On the Solutions of a Class of Continuous Linear Programs
- A continuous approach to nonlinear integer programming
- Certain parametric problems of integer convex programming and their approximate solution
- A note on ``A continuous approach to nonlinear integer programming
- A continuous method for convex programming problems
- On the relationship between the optima of linear and integer linear programming
Cites work
- An efficient branch and bound algorithm to solve the quadratic integer programming problem
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Convex separable optimization is not much harder than linear optimization
- Global optimization techniques for solving the general quadratic integer programming problem
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- Sensitivity theorems in integer linear programming
- Some proximity and sensitivity results in quadratic integer programming
- The relationship between integer and real solutions of constrained convex programming
- The value function of a mixed integer program. II
Cited in
(4)
This page was built for publication: On the relationship between the integer and continuous solutions of convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949923)