Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization

Please always quote using this URN: urn:nbn:de:0297-zib-64645
  • We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of this work is to determine whether the effect on the numerical conditioning of the LP relaxations resulting from the branching and cutting operations can be effectively predicted and whether such predictions can be used to make better algorithmic choices. In a first step towards this goal, we discuss here the numerical behavior of an existing solver in order to determine whether our intuitive understanding of this behavior is correct.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Matthias MiltenbergerORCiD, Ted Ralphs, Daniel SteffyORCiD
Document Type:ZIB-Report
Parent Title (English):Operations Research Proceedings 2017
Tag:Algorithm Analysis; Linear Programming; Mixed Integer Programming
Date of first Publication:2017/07/20
Series (Serial Number):ZIB-Report (17-43)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.