Engineering and evaluating multi-objective pseudo-Boolean optimizers
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- A computational status update for exact rational mixed integer programming
- A hybrid approach for biobjective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An Algorithm for Multiobjective Zero-One Linear Programming
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Bound sets for biobjective combinatorial optimization problems
- Branch-and-bound and objective branching with three or more objectives
- Branch-and-bound for bi-objective integer programming
- Certified Core-Guided MaxSAT Solving
- Certified MaxSAT preprocessing
- Certified dominance and symmetry breaking for combinatorial optimisation
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Efficient certified RAT verification
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Handbook of constraint programming.
- Handbook of satisfiability. In 2 parts
- Integration of constraint programming, artificial intelligence, and operations research. 21st international conference, CPAIOR 2024, Uppsala, Sweden, May 28--31, 2024. Proceedings. Part I
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Multicriteria Optimization
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- On SAT Modulo Theories and Optimization Problems
- On improvements of multi-objective branch and bound
- QMaxSATpb: a certified MaxSAT solver
- RC2: an efficient MaxSAT solver
- SAT-based leximax optimisation algorithms
- Solving a bicriterion scheduling problem
- Survey of multi-objective optimization methods for engineering
- Temporal induction by incremental SAT solving
- Unsatisfiability-based optimization in clasp
- Verifying integer programming results
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
This page was built for publication: Engineering and evaluating multi-objective pseudo-Boolean optimizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884753)
