Compact representations of all members of an independence system

DOI10.1007/s10472-016-9496-8zbMath1358.52015OpenAlexW2337442007MaRDI QIDQ513340

Utz-Uwe Haus, Carla Michini

Publication date: 6 March 2017

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-016-9496-8

zbMATH Keywords

enumerationstable setsBoolean optimizationcompact representationsdecision diagramsdiscrete relaxations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial optimization (90C27) Enumeration in graph theory (05C30) Polytopes and polyhedra (52B99)

Related Items (3)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Compact representation of near-optimal integer programming solutions ⋮ Decision Diagram Decomposition for Quadratically Constrained Binary Optimization

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperbolic set covering problems with competing ground-set elements
• Graph 2-isomorphism is NP-complete
• Integral decomposition of polyhedra and some applications in mixed integer programming
• A primal all-integer algorithm based on irreducible solutions
• Manipulating MDD Relaxations for Combinatorial Optimization
• Graph-Based Algorithms for Boolean Function Manipulation
• Boltzmann Sampling of Unlabelled Structures

This page was built for publication: Compact representations of all members of an independence system