Verifying integer programming results

DOI10.1007/978-3-319-59250-3_13zbMath1418.90176arXiv1611.08832OpenAlexW2558711366MaRDI QIDQ2401153

Ambros M. Gleixner, Daniel E. Steffy, Kevin K. H. Cheung

Publication date: 31 August 2017

Full work available at URL: https://arxiv.org/abs/1611.08832

zbMATH Keywords

verificationcorrectnessoptimalitymixed integer linear programminginfeasibilityproofcertificate

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (9)

A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ Compressing branch-and-bound trees ⋮ Characterizing 3-Sets in Union-Closed Families ⋮ Optimal length cutting plane refutations of integer programs ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework ⋮ Cutting planes for families implying Frankl’s conjecture ⋮ A computational status update for exact rational mixed integer programming ⋮ A computational status update for exact rational mixed integer programming

Uses Software

• SCIP
• MIPLIB
• CPLEX
• Benchmarks for Optimization Software
• QSopt_ex
• HOL Light
• Flyspeck
• DRAT-trim
• VIPR

This page was built for publication: Verifying integer programming results