New core-guided and hitting set algorithms for multi-objective combinatorial optimization
DOI10.1007/978-3-031-30820-8_7zbMATH Open1547.68706MaRDI QIDQ6536121FDOQ6536121
Authors: João Cortes, Inês Lynce, Vasco Manquinho 
Publication date: 5 April 2024
Recommendations
- Boolean lexicographic optimization: algorithms \& applications
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- scientific article; zbMATH DE number 2159075
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09) Computational aspects of satisfiability (68R07)
Cites Work
- PackUp: tools for package upgradability solving
- Efficient CNF encoding of Boolean cardinality constraints
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- Boolean lexicographic optimization: algorithms \& applications
- Approximating the Pareto front of multi-criteria optimization problems
- Exact hypervolume subset selection through incremental computations
- Introducing Pareto minimal correction subsets
- Encoding cardinality constraints using multiway merge selection networks
- Incremental encoding of pseudo-Boolean goal functions based on comparator networks
- MaxSAT-based bi-objective Boolean optimization
Cited In (1)
This page was built for publication: New core-guided and hitting set 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 Q6536121)
