New core-guided and hitting set algorithms for multi-objective combinatorial optimization

DOI10.1007/978-3-031-30820-8_7MaRDI QIDQ6536121zbMATH OpenFDO

Authors João Cortes, Inês Lynce, Vasco Manquinho

Publication date 5 April 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30820-8_7

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

• Algorithms for Weighted Boolean Optimization
• Approximating the Pareto front of multi-criteria optimization problems
• Boolean lexicographic optimization: algorithms \& applications
• Efficient CNF encoding of Boolean cardinality constraints
• Encoding cardinality constraints using multiway merge selection networks
• Exact hypervolume subset selection through incremental computations
• Incremental encoding of pseudo-Boolean goal functions based on comparator networks
• Introducing Pareto minimal correction subsets
• MaxSAT-based bi-objective Boolean optimization
• PackUp: tools for package upgradability solving
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing

Cited in

(4)

• Exact and approximate determination of the Pareto front using minimal correction subsets
• Unsatisfiability-based algorithms for multi-objective combinatorial optimization
• Engineering and evaluating multi-objective pseudo-Boolean optimizers
• Multi-objective maximum satisfiability by single-objective implicit hitting set optimization

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)