Boolean lexicographic optimization: algorithms \& applications
From MaRDI portal
Boolean lexicographic optimization: algorithms \& applications
Recommendations
- Lexicographic search of optimal solutions of Boolean programming problems
- scientific article; zbMATH DE number 5159232
- Auxiliary possibilities of the solution of a lexicographic knapsack problem in Boolean programming
- Solving Multi-objective Pseudo-Boolean Problems
- Algorithms for Weighted Boolean Optimization
Cites work
- 2006 and 2007 Max-SAT evaluations: contributed instances
- A linear-time transformation of linear inequalities into conjunctive normal form
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A Weighting Function for Pre-emptive Multicriteria Assignment Problems
- Algorithms for the maximum satisfiability problem
- Algorithms for Weighted Boolean Optimization
- Conflict-Driven Answer Set Enumeration
- Earth observation satellite management
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Lexicographically-ordered constraint satisfaction problems
- Logic programming with satisfiability
- Minimaxsat: an efficient weighted Max-SAT solver
- MIPLIB 2003
- Multi‐objective combinatorial optimization problems: A survey
- New inference rules for Max-SAT
- On Solving the Partial MAX-SAT Problem
- Optimal Protein Structure Alignment Using Maximum Cliques
- Satisfiability-based algorithms for Boolean optimization
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving Multi-objective Pseudo-Boolean Problems
- Solving satisfiability problems with preferences
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Cited in
(29)- Boolean query optimization and the 0-1 hyperbolic sum problem
- Lexicographic search of optimal solutions of Boolean programming problems
- B{\&}B method for discrete partial order optimization
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
- On preprocessing for weighted MaxSAT
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Iterative and core-guided maxsat solving: a survey and assessment
- A lexicographic optimization algorithm
- Speeding up the constraint-based method in difference logic
- scientific article; zbMATH DE number 5158986 (Why is no real title available?)
- Solving Multi-objective Pseudo-Boolean Problems
- Generalized lexicographic multiobjective combinatorial optimization. Application to cryptography
- Multi-threaded ASP solving with clasp
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- RC2: an efficient MaxSAT solver
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- MaxSAT resolution for regular propositional logic
- Exact and approximate determination of the Pareto front using minimal correction subsets
- A new cutting plane method for lexicographic multi-objective integer linear programming
- Certified Core-Guided MaxSAT Solving
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Solving weighted maximum satisfiability with branch and bound and clause learning
- New tableau characterizations for non-clausal regular MinSAT and MaxSAT problems
- Solving for blameless and optimal control under prioritized safety constraints
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
This page was built for publication: Boolean lexicographic optimization: algorithms \& applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421451)
