A branch and price algorithm for the SS/TDMA problem with cardinality constraint.

Fabio Colombo Marco Trubian

Published in: Comput. Oper. Res. (2013)

Keyphrases

computational complexity
objective function
probabilistic model
worst case
dynamic programming
knapsack problem
database systems
optimal solution
relational databases
np hard
data sources
simulated annealing
conceptual model
cardinality constraints