Pages that link to "Item:Q1899421"
From MaRDI portal
The following pages link to Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421):
Displaying 9 items.
- Some proximity and sensitivity results in quadratic integer programming (Q751508) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
- Sensitivity results in integer linear programming (Q3682243) (← links)
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← 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)
