Name
Abstract | ||
|---|---|---|
In this paper we discuss the problems that occur when splitting wide tables across multiple pages. We focus our attention on finding solutions that minimize the impact on the meaning of data when the objective is to reorder the columns such that the number of pages used is minimal. Reordering of columns in a table raises a number of complex optimization problems that we will study in this paper: minimizing page count and at the same time the number of column positions changes or the number of column groups split across pages. We show that by using integer programming solutions the number of pages used when splitting wide tables can be reduced by up to 25% and it can be achieved in short computational time. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2494266.2494317 | ACM Symposium on Document Engineering |
Keywords | Field | DocType |
integer programming solution,complex optimization problem,page count,splitting wide table,column positions change,column group,splitting wide tables optimally,multiple page,short computational time,constrained optimization | Mathematical optimization,Computer science,Algorithm,Integer programming,Optimization problem,Table (information),Constrained optimization | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihai Bilauca | 1 | 9 | 2.00 |
| Patrick Healy | 2 | 59 | 6.62 |