Exact and approximate determination of the Pareto front using minimal correction subsets

DOI10.1016/j.cor.2023.106153arXiv2204.06908OpenAlexW4316039608MaRDI QIDQ6164362

No author found.

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.06908

zbMATH Keywords

approximation algorithmsminimal correction subsetsmulti-objective Boolean optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curriculum-based course timetabling with SAT and MaxSAT
• Cardinality networks: a theoretical and empirical study
• Multiobjective optimization. Interactive and evolutionary approaches
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• Improving MCS enumeration via caching
• Introducing Pareto minimal correction subsets
• Encoding cardinality constraints using multiway merge selection networks
• One-exact approximate Pareto sets
• Principles and practice of constraint programming. 21st international conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015. Proceedings
• Incremental encoding of pseudo-Boolean goal functions based on comparator networks
• A New Look at BDDs for Pseudo-Boolean Constraints
• Open-WBO: A Modular MaxSAT Solver,
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• New Encodings of Pseudo-Boolean Constraints into CNF
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Multicriteria Optimization
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Exact and approximate determination of the Pareto front using minimal correction subsets