Satisfiability modulo theories for verifying MILP certificates
From MaRDI portal
Cites work
- A brief history of linear and mixed-integer programming computation
- A proof of the Kepler conjecture
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- An automated deductive verification framework for circuit-building quantum programs
- An exact rational mixed-integer programming solver
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
- Certification of an optimal TSP tour through 85,900 cities
- Characterizing 3-Sets in Union-Closed Families
- Computer-aided proof of Erdős discrepancy properties
- Cutting planes for families implying Frankl's conjecture
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Isabelle/HOL. A proof assistant for higher-order logic
- Progress in mathematical programming solvers from 2001 to 2020
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Satisfiability modulo theories: an appetizer
- Sledgehammer: judgement day
- SMTCoq: a plug-in for integrating SMT solvers into Coq
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- The MathSAT5 SMT solver
- Using integer programming to search for counterexamples: a case study
- Verifying integer programming results
This page was built for publication: Satisfiability modulo theories for verifying MILP certificates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289912)
