Safe bounds in linear and mixed-integer linear programming

2004/03/01 by Arnold Neumaier, Oleg Shcherbina · 6 citations
Computer Science · Engineering · Mathematics · #Numerical Methods and Algorithms #Low-power high-performance VLSI design #Advanced Optimization Algorithms Research

paper · doi:10.1007/s10107-003-0433-3

Cited by

• A computational status update for exact rational mixed integer programming
• A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem
• UniCalc.LIN: a linear constraint solver for the UniCalc system
• Analyzing the Numerical Correctness of Branch-and-Bound Decisions for Mixed-Integer Programming
• ILP Modulo Theories
• The Sweet Spot of Bound Tightening for Topology Optimization