Pages that link to "Item:Q1176807"
From MaRDI portal
The following pages link to The relationship between integer and real solutions of constrained convex programming (Q1176807):
Displaying 9 items.
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
- Proximity in concave integer quadratic programming (Q2149572) (← links)
- Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
- Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
- The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides (Q5080676) (← links)
- On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
- On the relationship between the integer and continuous solutions of convex programs (Q5949923) (← links)