Partition Crossover for Pseudo-Boolean Optimization
From MaRDI portal
Recommendations
- Pseudo-Boolean optimization
- Partition search for non-binary constraint satisfaction
- Partitioning by Particle Swarm Optimization
- Optimized Crossover for the Independent Set Problem
- Optimization over pseudo-Boolean lattices
- Convergent tabu search for optimal partitioning
- Pseudo-Boolean optimization with a disjunctive constraint
- Efficient local search for pseudo Boolean optimization
- A partition-based global optimization algorithm
Cites work
Cited in
(6)- A large population island framework for the unconstrained binary quadratic problem
- Decomposing SAT Instances with Pseudo Backbones
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
- Quasi-optimal recombination operator
- Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
- Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions
This page was built for publication: Partition Crossover for Pseudo-Boolean Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981894)