A Linear Programming Relaxation for Binary Tomography with Smoothness Priors.
Stefan WeberChristoph SchnörrJoachim HorneggerPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- linear programming relaxation
- binary variables
- knapsack problem
- lower bound
- linear programming
- column generation
- prior information
- integer programming
- mixed integer programming
- integer solution
- branch and bound
- feasible solution
- image reconstruction
- valid inequalities
- cutting plane
- integer program
- objective function
- linear program
- search space
- optimal solution
- maximum a posteriori
- production planning
- optimization problems
- np hard
- genetic algorithm