scientific article; zbMATH DE number 3904333

zbMATH Open0566.90065MaRDI QIDQ3682243FDOQ3682243

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

Publication date: 1985

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

integer linear programmingfixed coefficient matrixvarying objective function and right-hand-side vector

Mathematics Subject Classification ID

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

Cited In (10)

• Tightness of sensitivity and proximity bounds for integer linear programs
• Non-linear integer programming: Sensitivity analysis for branch and bound
• Some proximity and sensitivity results in quadratic integer programming
• Two sensitivity theorems in fuzzy integer programming.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improving the Cook et al. proximity bound given integral valued constraints
• Sensitivity theorems in integer linear programming
• Metric aspects of integer linear programming
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming

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)