This article discusses an efficient formulation of the data layout selection problem as a 0-1 integer programming problem.
Instead of using a heuristic, the current framework formulates the interdimensional alignment problem as an efficient 0-1 integer programming problem.
Instead of relying on heuristics to approximate the optimal solution in the general case, the data layout selection problem is translated into a linear 0-1 integer programming problem and solved optimally.
2 Efficiency of 0-1 Integer Programming Formulations.
Once an efficient 0-1 problem formulation has been found, algorithmic improvements in 0-1 integer programming technology can be immediately exploited.