Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach.
Changlin WanZhongzhi ShiPublished in: FAW (2008)
Keyphrases
- solving problems
- solving complex
- constraint problems
- np complete
- combinatorial optimization
- convex quadratic programming
- min sum
- problems involving
- optimization problems
- dynamic programming
- special case
- search space
- neural network
- linear programming problems
- objective function
- sparse linear systems
- feature selection