Unsatisfiability-based algorithms for multi-objective combinatorial optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1852147 (Why is no real title available?)
- Abstract cores in implicit hitting set MaxSat solving
- Algorithms for Weighted Boolean Optimization
- Approximating the Pareto front of multi-criteria optimization problems
- Boolean lexicographic optimization: algorithms \& applications
- Bound sets for biobjective combinatorial optimization problems
- Efficient CNF encoding of Boolean cardinality constraints
- Efficient SAT solving under assumptions
- Encoding cardinality constraints using multiway merge selection networks
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Exact hypervolume subset selection through incremental computations
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Incremental encoding of pseudo-Boolean goal functions based on comparator networks
- Introducing Pareto minimal correction subsets
- LMHS: a SAT-IP hybrid MaxSat solver
- Multi-objective branch and bound
- Multicriteria Optimization
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- On Solving the Partial MAX-SAT Problem
- On improving MUS extraction algorithms
- Open-WBO: a modular MaxSAT solver
- PackUp: tools for package upgradability solving
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Temporal induction by incremental SAT solving
- The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
- Theory and Applications of Satisfiability Testing
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
This page was built for publication: Unsatisfiability-based algorithms for multi-objective combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834473)
