A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem

DOI10.1111/J.1467-9574.2007.00357.XzbMATH Open1122.90100OpenAlexW2171353686MaRDI QIDQ5422011FDOQ5422011

Antoon W. J. Kolen

Publication date: 26 October 2007

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/61f04ac9-be8d-434f-80d3-4fd63e9aec0a

Recommendations

• A genetic algorithm for the generalised assignment problem
• Genetic algorithms in constrained optimization
• VEGAS -- a new genetic algorithm for satisfiability
• A genetic approach to the quadratic assignment problem
• Genetic algorithm for linear and cyclic assignment problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Algorithms for Radio Link Frequency Assignment: The Calma Project
• Title not available (Why is that?)
• The partial constraint satisfaction problem: Facets and lifting theorems

Cited In (6)

• GA performance distributions and randomly generated binary constraint satisfaction problems.
• Guided genetic algorithm and its application to radio link frequency assignment problems
• Models and solution techniques for frequency assignment problems
• Algorithms for the generalized weighted frequency assignment problem
• 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

Uses Software

• CALMA

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)