scientific article; zbMATH DE number 3904333

MaRDI QIDQ3682243zbMATH OpenFDO

Authors A. M. H. Gerards, Éva Tardos, William Cook, Alexander Schrijver

Publication date 1985

zbMATH Keywords

fixed coefficient matrixinteger linear programmingvarying objective function and right-hand-side vector

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Linear programming (90C05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Sensitivity theorems in integer linear programming
• Tightness of sensitivity and proximity bounds for integer linear programs
• Some proximity and sensitivity results in quadratic integer programming
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Improving the Cook et al. proximity bound given integral valued constraints

Cited in

(10)

• Non-linear integer programming: Sensitivity analysis for branch and bound
• Two sensitivity theorems in fuzzy integer programming.
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Improving the Cook et al. proximity bound given integral valued constraints
• scientific article; zbMATH DE number 4035567 (Why is no real title available?)
• Sensitivity theorems in integer linear programming
• Metric aspects of integer linear programming
• scientific article; zbMATH DE number 764459 (Why is no real title available?)
• Some proximity and sensitivity results in quadratic integer programming
• Tightness of sensitivity and proximity bounds for integer linear programs

This page was built for publication:

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