Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
From MaRDI portal
Publication:6635982
DOI10.1007/978-3-031-57712-3_8MaRDI QIDQ6635982FDOQ6635982
Authors: Darrell Whitley, Gabriela Ochoa, Noah Floyd, Francisco Chicano
Publication date: 12 November 2024
Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Improving stochastic local search for SAT with a new probability distribution
- Theory and Applications of Satisfiability Testing
- Pseudo-Boolean optimization
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Survey propagation: An algorithm for satisfiability
- Compact quadratizations for pseudo-Boolean functions
- Partition Crossover for Pseudo-Boolean Optimization
- Decomposing SAT Instances with Pseudo Backbones
- Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions
This page was built for publication: Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635982)