Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
From MaRDI portal
Recommendations
Cites work
- 0/1 vertex and facet enumeration with BDDs
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Conflict analysis in mixed integer programming
- Counting Models in Integer Domains
- Effective lattice point counting in rational convex polytopes
- Generating Multiple Solutions for Mixed Integer Programming Problems
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- MIP: Theory and practice -- closing the gap
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
Cited in
(3)
This page was built for publication: Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387636)