Boolean Methods of Optimization over Independence Systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 38107
- scientific article; zbMATH DE number 279581
- scientific article; zbMATH DE number 279605
- Satisfiability-based algorithms for Boolean optimization
- Publication:3033323
- scientific article; zbMATH DE number 3874955
- Discrete dynamical system approaches for Boolean polynomial optimization
- Solution and Optimization of Systems of Pseudo-Boolean Constraints
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- Boolean optimization algorithm on (0,1)-matrices
Cites work
- scientific article; zbMATH DE number 3878668 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Linear and combinatorial optimization in ordered algebraic structures
Cited in
(5)- On accuracy, robustness and tolerances in vector Boolean optimization
- scientific article; zbMATH DE number 4131662 (Why is no real title available?)
- scientific article; zbMATH DE number 3878668 (Why is no real title available?)
- More on independence systems
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
This page was built for publication: Boolean Methods of Optimization over Independence Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337220)