Pages that link to "Item:Q421451"
From MaRDI portal
The following pages link to Boolean lexicographic optimization: algorithms \& applications (Q421451):
Displaying 15 items.
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- ATLAS: automated amortised complexity analysis of self-adjusting data structures (Q832253) (← links)
- B{\&}B method for discrete partial order optimization (Q2010369) (← links)
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (Q2204444) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- Multi-threaded ASP solving with clasp (Q4911132) (← links)
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
- Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- A new cutting plane method for lexicographic multi-objective integer linear programming (Q6189414) (← links)
