Maximum satisfiability formulations for nonlinear integer programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 2152342 (Why is no real title available?)
- Another look at graph coloring via propositional satisfiability
- BDDs for pseudo-Boolean constraints -- revisited
- Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description)
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Exact MinSAT Solving
- Experimenting on solving nonlinear integer arithmetic with incremental linearization
- Formal Methods for Hardware Verification
- Handbook of satisfiability. In 2 parts
- Integer Polynomial Optimization in Fixed Dimension
- Nonlinear integer programming
- Nonlinear integer programming
- Theory and Applications of Satisfiability Testing
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Über die partiellen Differenzengleichungen der mathematischen Physik.
This page was built for publication: Maximum satisfiability formulations for nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884711)
