Compact representations of all members of an independence system

DOI10.1007/S10472-016-9496-8MaRDI QIDQ513340zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

enumerationstable setsBoolean optimizationcompact representationsdecision diagramsdiscrete relaxations

Mathematics Subject Classification ID

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

Recommendations

• Optimization Bounds from Binary Decision Diagrams
• Discrete optimization with decision diagrams
• Experimental and Efficient Algorithms
• BDDs -- design, analysis, complexity, and applications.
• On threshold BDDs and the optimal variable ordering problem

Cites work

• scientific article; zbMATH DE number 1302195 (Why is no real title available?)
• scientific article; zbMATH DE number 1150567 (Why is no real title available?)
• scientific article; zbMATH DE number 939919 (Why is no real title available?)
• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• A primal all-integer algorithm based on irreducible solutions
• Boltzmann sampling of unlabelled structures
• Computing the Tutte polynomial of a graph of moderate size
• Graph 2-isomorphism is NP-complete
• Graph-Based Algorithms for Boolean Function Manipulation
• Hyperbolic set covering problems with competing ground-set elements
• Integral decomposition of polyhedra and some applications in mixed integer programming
• Manipulating MDD relaxations for combinatorial optimization
• Polyhedral combinatorics and combinatorial optimization

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

Describes a project that uses

Uses Software

• DIMACS

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)