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

DOI10.1007/978-3-031-30820-8_7zbMATH Open1547.68706MaRDI QIDQ6536121

Inês Lynce, João Cortes, Vasco M. Manquinho

Publication date: 5 April 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Boolean lexicographic optimization: algorithms \& applications
• Introducing Pareto minimal correction subsets
• Encoding cardinality constraints using multiway merge selection networks
• Incremental encoding of pseudo-Boolean goal functions based on comparator networks
• Exact hypervolume subset selection through incremental computations
• Approximating the Pareto Front of Multi-criteria Optimization Problems
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Algorithms for Weighted Boolean Optimization
• Principles and Practice of Constraint Programming – CP 2003
• MaxSAT-based bi-objective Boolean optimization

This page was built for publication: New core-guided and hitting set algorithms for multi-objective combinatorial optimization