Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets.
Ryuhei MoriTakeshi KoshibaOsamu WatanabeMasaki YamamotoPublished in: CoRR (2014)
Keyphrases
- non binary
- linear programming relaxation
- constraint satisfaction problems
- knapsack problem
- linear programming
- lower bound
- integer programming
- column generation
- mixed integer programming
- branch and bound
- cutting plane
- feasible solution
- integer program
- binary representation
- valid inequalities
- arc consistency
- frequent pattern mining
- constraint satisfaction
- upper bound
- search space
- branch and bound algorithm
- production planning
- hidden variables
- data mining
- np complete
- optimization problems
- np hard
- special case
- search algorithm