Recommendations
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- Local search algorithms for the radio link frequency assignment problem
- Models and solution techniques for frequency assignment problems
- Models and solution techniques for frequency assignment problems
- scientific article; zbMATH DE number 1163710
Cited in
(34)- A framework for certified Boolean branch-and-bound optimization
- On-line resources allocation for ATM networks with rerouting
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
- Learning constraints through partial queries
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- Reasoning from last conflict(s) in constraint programming
- Tractability-preserving transformations of global cost functions
- Constraint reasoning
- Valued constraint satisfaction problems
- Valid Inequality Based Lower Bounds for WCSP
- Solving weighted CSP by maintaining arc consistency
- Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
- Combining VNS with constraint programming for solving anytime optimization problems
- Guided genetic algorithm and its application to radio link frequency assignment problems
- Virtual pairwise consistency in cost function networks
- CNF encodings of symmetric functions
- Multiple-choice knapsack constraint in graphical models
- Models and solution techniques for frequency assignment problems
- An optimal coarse-grained arc consistency algorithm
- Propagation via lazy clause generation
- Modularity-based decompositions for valued CSP
- Soft arc consistency revisited
- Learning cluster-based structure to solve constraint satisfaction problems
- Identifying and exploiting problem structures using explanation-based constraint programming
- Maintaining reversible DAC for Max-CSP
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Triangle-based consistencies for cost function networks
- Efficient multiple constraint acquisition
- Hybrid backtracking bounded by tree-decomposition of constraint networks
This page was built for publication: Radio link frequency assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294046)
