Boolean lexicographic optimization: algorithms \& applications

DOI10.1007/s10472-011-9233-2zbMath1242.90199OpenAlexW2009689138MaRDI QIDQ421451

Josep Argelich, Inês Lynce, Ana Graça, João P. Marques-Silva

Publication date: 23 May 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10459.1/57277

zbMATH Keywords

maximum satisfiabilitypseudo-Boolean optimizationBoolean optimizationhaplotyping with pedigreeslexicographic optimizationsoftware package dependencies

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

ATLAS: automated amortised complexity analysis of self-adjusting data structures, MaxSAT resolution for regular propositional logic, A new cutting plane method for lexicographic multi-objective integer linear programming, Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology, On preprocessing for weighted MaxSAT, On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes, Multi-threaded ASP solving with clasp, Exploiting subproblem optimization in SAT-based maxsat algorithms, B{\&}B method for discrete partial order optimization, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Speeding up the Constraint-Based Method in Difference Logic, On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving, RC2: an Efficient MaxSAT Solver, Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT, Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• MIPLIB
• PBS
• clasp
• Sat4j
• MIPLIB2003
• OPIUM
• MiniMaxSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• Solving satisfiability problems with preferences
• Algorithms for the maximum satisfiability problem
• Satisfiability-based algorithms for Boolean optimization
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• Earth observation satellite management
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Lexicographically-ordered constraint satisfaction problems
• MIPLIB 2003
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
• Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information
• Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
• Solving Multi-objective Pseudo-Boolean Problems
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Algorithms for Weighted Boolean Optimization
• A Weighting Function for Pre-emptive Multicriteria Assignment Problems
• Multi‐objective combinatorial optimization problems: A survey
• Optimal Protein Structure Alignment Using Maximum Cliques
• Conflict-Driven Answer Set Enumeration
• Logic programming with satisfiability
• On Solving the Partial MAX-SAT Problem