Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach.
Lamia Sadeg-BelkacemZineb HabbasFatima Benbouzid-Si TayebDaniel SingerPublished in: ICAART (1) (2014)
Keyphrases
- solving problems
- solving complex
- np complete
- benchmark problems
- neural network
- data sets
- quadratic programming problems
- combinatorial optimization
- combinatorial optimisation
- exact solution
- constrained problems
- convex quadratic programming
- sparse linear systems
- constraint problems
- resource constrained project scheduling problem
- linear programming problems
- decomposition methods
- decomposition method
- problems involving
- optimization problems
- multiresolution
- multiscale