Counting Solutions of Integer Programs Using Unrestricted Subtree Detection

DOI10.1007/978-3-540-68155-7_22zbMath1142.90453OpenAlexW1479668226MaRDI QIDQ5387636

Tobias Achterberg, Stefan Heinz, Thorsten Koch

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_22

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

The minimum sum representation as an index of voting power, Compact representation of near-optimal integer programming solutions

Uses Software

• SCIP
• MIPLIB
• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
• Conflict analysis in mixed integer programming
• Effective lattice point counting in rational convex polytopes
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• 0/1 vertex and facet enumeration with BDDs
• Generating Multiple Solutions for Mixed Integer Programming Problems
• Counting Models in Integer Domains