Radio link frequency assignment

DOI10.1023/A:1009812409930zbMath1020.94500OpenAlexW1485366229MaRDI QIDQ1294046

K. Appert

Publication date: 30 September 2003

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009812409930

zbMATH Keywords

optimizationconstraint satisfactioncommunication networkradio communication linksradio frequency assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Communication theory (94A05)

Related Items (29)

Efficient multiple constraint acquisition ⋮ Tractability-preserving transformations of global cost functions ⋮ Identifying and exploiting problem structures using explanation-based constraint programming ⋮ Modularity-based decompositions for valued CSP ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Multiple-choice knapsack constraint in graphical models ⋮ Virtual pairwise consistency in cost function networks ⋮ Learning constraints through partial queries ⋮ A framework for certified Boolean branch-and-bound optimization ⋮ Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ Triangle-based consistencies for cost function networks ⋮ Valid Inequality Based Lower Bounds for WCSP ⋮ Learning cluster-based structure to solve constraint satisfaction problems ⋮ 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 ⋮ An optimal coarse-grained arc consistency algorithm ⋮ Soft arc consistency revisited ⋮ On-line resources allocation for ATM networks with rerouting ⋮ Propagation via lazy clause generation ⋮ Models and solution techniques for frequency assignment problems ⋮ Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP ⋮ Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates ⋮ Maintaining reversible DAC for Max-CSP ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ Reasoning from last conflict(s) in constraint programming ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction ⋮ Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction ⋮ Hybrid backtracking bounded by tree-decomposition of constraint networks ⋮ Solving weighted CSP by maintaining arc consistency

This page was built for publication: Radio link frequency assignment