On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model.
Valentin E. BrimkovStefan S. DantchevPublished in: IFIP TCS (2000)
Keyphrases
- computational model
- integer programming
- computational models
- np hard
- linear programming
- production planning
- lagrangian relaxation
- computational framework
- cutting plane
- constraint programming
- cutting plane algorithm
- facility location
- computational modeling
- network flow
- ai planning
- set covering problem
- column generation
- set covering
- transportation problem
- cognitive modeling
- cognitive architecture
- working memory
- visual processing
- integer program
- inference problems
- language acquisition
- valid inequalities
- reinforcement learning
- dantzig wolfe decomposition
- qos multicast routing
- linear program
- worst case
- computational complexity
- optimal solution