Compact representations of all members of an independence system
DOI10.1007/S10472-016-9496-8zbMATH Open1358.52015OpenAlexW2337442007MaRDI QIDQ513340FDOQ513340
Authors: 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
Recommendations
enumerationstable setsBoolean optimizationcompact representationsdecision diagramsdiscrete relaxations
Combinatorial optimization (90C27) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Polytopes and polyhedra (52B99)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Manipulating MDD relaxations for combinatorial optimization
- Title not available (Why is that?)
- Computing the Tutte polynomial of a graph of moderate size
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boltzmann sampling of unlabelled structures
- Title not available (Why is that?)
- 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
- Polyhedral combinatorics and combinatorial optimization
- Hyperbolic set covering problems with competing ground-set elements
Cited In (6)
- On a composition of independence systems by circuit identification
- On finding the optimal BDD relaxation
- Compact representation of near-optimal integer programming solutions
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Experimental and Efficient Algorithms
Uses Software
This page was built for publication: Compact representations of all members of an independence system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513340)
