Pages that link to "Item:Q2288201"

The following pages link to Distances between optimal solutions of mixed-integer programs (Q2288201):

Displaying 14 items.

• Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
• Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
• The covering radius and a discrete surface area for non-hollow simplices (Q2066303) (← links)
• Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
• The integrality number of an integer program (Q2118127) (← links)
• Proximity in concave integer quadratic programming (Q2149572) (← links)
• On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
• Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
• The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides (Q5080676) (← links)
• On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases (Q5099099) (← links)
• The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
• On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
• Evaluating mixed-integer programming models over multiple right-hand sides (Q6047695) (← links)
• A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)