Reconstructing (0, 1)-matrices from projections using integer programming.
Geir DahlTruls FlatbergPublished in: Comput. Optim. Appl. (2009)
Keyphrases
- integer programming
- binary matrices
- discrete tomography
- projection matrices
- linear programming
- np hard
- projection matrix
- constraint programming
- rows and columns
- binary matrix
- cutting plane algorithm
- network flow
- lagrangian relaxation
- production planning
- facility location
- ai planning
- column generation
- cutting plane
- valid inequalities
- set covering problem
- tomographic reconstruction
- set covering
- crew scheduling
- dantzig wolfe decomposition
- transportation problem
- linear programming relaxation
- convex sets
- singular value decomposition
- discrete sets
- learning algorithm
- inference problems
- vehicle routing problem with time windows
- image reconstruction