A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
From MaRDI portal
Publication:5422011
Recommendations
Cites work
Cited in
(8)- GA performance distributions and randomly generated binary constraint satisfaction problems.
- A hybrid genetic algorithm for constrained combinatorial problems: an application to promotion planning problems
- Guided genetic algorithm and its application to radio link frequency assignment problems
- Algorithms for the generalized weighted frequency assignment problem
- Models and solution techniques for frequency assignment problems
- VEGAS -- a new genetic algorithm for satisfiability
- A study of permutation operators for minimum span frequency assignment using an order based representation
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
This page was built for publication: A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422011)