Some proximity and sensitivity results in quadratic integer programming

DOI10.1007/BF01580862MaRDI QIDQ751508zbMATH OpenOpenAlexFDO

Authors Frieda Granot, Jadranka Skorin-Kapov

Publication date 1990

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01580862

zbMATH Keywords

sensitivity analysiscontinuous relaxationproximity resultsseparable quadratic integer programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Proximity in concave integer quadratic programming
• scientific article; zbMATH DE number 3904333
• On the relationship between the integer and continuous solutions of convex programs
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Tightness of sensitivity and proximity bounds for integer linear programs

Cites work

• scientific article; zbMATH DE number 3349178 (Why is no real title available?)
• Duality in quadratic programming
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Sensitivity theorems in integer linear programming
• Stability of mixed-integer quadratic programming problems
• Stability of the solution of definite quadratic programs

Cited in

(24)

• On Proximity for k-Regular Mixed-Integer Linear Optimization
• scientific article; zbMATH DE number 6850361 (Why is no real title available?)
• Complexity and algorithms for nonlinear optimization problems
• Error bounds for mixed integer linear optimization problems
• Tightness of sensitivity and proximity bounds for integer linear programs
• On simultaneous approximation in quadratic integer programming
• Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs
• Two-stage quadratic integer programs with stochastic right-hand sides
• Ellipsoid bounds for convex quadratic integer programming
• New characterizations of Hoffman constants for systems of linear constraints
• The gap function: evaluating integer programming models over multiple right-hand sides
• Distances between optimal solutions of mixed-integer programs
• Subdeterminants and concave integer quadratic programming
• Proximity in concave integer quadratic programming
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
• Continuity of parametric mixed-integer quadratic programs and its application to stability analysis of two-stage quadratic stochastic programs with mixed-integer recourse
• On the relationship between the integer and continuous solutions of convex programs
• Quantitative stability of mixed-integer two-stage quadratic stochastic programs
• Improving the Cook et al. proximity bound given integral valued constraints
• A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
• Sensitivity theorems in integer linear programming
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• scientific article; zbMATH DE number 3904333 (Why is no real title available?)
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

This page was built for publication: Some proximity and sensitivity results in quadratic integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751508)