Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
DAC '96 Proceedings of the 33rd annual Design Automation Conference
A linear-time transformation of linear inequalities into conjunctive normal form
Information Processing Letters
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Earth Observation Satellite Management
Constraints
Generic ILP versus specialized 0-1 ILP: an update
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A fast pseudo-boolean constraint solver
Proceedings of the 40th annual Design Automation Conference
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Optimal Protein Structure Alignment Using Maximum Cliques
Operations Research
Multicriteria Optimization
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
OPIUM: Optimal Package Install/Uninstall Manager
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Logic programming with satisfiability
Theory and Practice of Logic Programming
Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Dependency management for the eclipse ecosystem: eclipse p2, metadata and resolution
Proceedings of the 1st international workshop on Open component ecosystems
Planning as satisfiability with preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
Exploiting inference rules to compute lower bounds for MAX-SAT solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On solving Boolean multilevel optimization problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Solving multi-objective pseudo-boolean problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Towards more effective unsatisfiability-based maximum satisfiability algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Solving satisfiability problems with preferences
Constraints
Soft arc consistency applied to optimal planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
On solving the partial MAX-SAT problem
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Efficient and accurate haplotype inference by combining parsimony and pedigree information
ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology
Operations Research Letters
Annals of Mathematics and Artificial Intelligence
Improvements to core-guided binary search for MaxSAT
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Improving SAT-Based weighted MaxSAT solvers
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Artificial Intelligence
| Hi-index | 0.00 |
Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for either Maximum Satisfiability (MaxSAT), Pseudo-Boolean Optimization (PBO), or Integer Linear Programming (ILP). Experimental results, obtained on problem instances from haplotyping with pedigrees and software package dependencies, show that the proposed algorithms can provide significant performance gains over state of the art MaxSAT, PBO and ILP algorithms. Finally, the paper also shows that lexicographic optimization conditions are observed in the majority of the problem instances from the MaxSAT evaluations, motivating the development of dedicated algorithms that can exploit lexicographic optimization conditions in general MaxSAT problem instances.