Analyzing the Numerical Correctness of Branch-and-Bound Decisions for Mixed-Integer Programming

2025/01/01 by Alexander Hoen, Ambros Gleixner · 1 voice
Computer Science · Decision Sciences · Engineering · #Auction Theory and Applications #Optimization and Search Problems #Scheduling and Optimization Algorithms

paper · doi:10.1007/978-3-031-95976-9_3

crossref issued 2025/01/01 · crossref published 2025/01/01 · crossref published-print 2025/01/01 · openalex publication_date 2025/01/01 · crossref created 2025/06/28 · crossref published-online 2025/06/29 · openalex created_date 2025/10/10 · crossref deposited 2026/04/30 · crossref indexed 2026/07/01 · openalex updated_date 2026/07/29

Citations

• Safe bounds in linear and mixed-integer linear programming
• A computational status update for exact rational mixed integer programming

Discussions

• Alexander Hoen guides us into the space of mixed integer programming and talks about analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming. doi.org/10.1007/97 [bsky, 3 points, 1 comments]