Splitting wide tables optimally

Mihai Bilauca, Patrick Healy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationDocEng 2013 - Proceedings of the 2013 ACM Symposium on Document Engineering
PublisherAssociation for Computing Machinery
Pages249-252
Number of pages4
ISBN (Print)9781450317894
DOIs
Publication statusPublished - 2013
Event2013 ACM Symposium on Document Engineering, DocEng 2013 - Florence, Italy
Duration: 10 Sep 201313 Sep 2013

Publication series

NameDocEng 2013 - Proceedings of the 2013 ACM Symposium on Document Engineering

Conference

Conference2013 ACM Symposium on Document Engineering, DocEng 2013
Country/TerritoryItaly
CityFlorence
Period10/09/1313/09/13

Keywords

  • constrained optimization
  • table layout
  • tabular layout
  • wide tables

Fingerprint

Dive into the research topics of 'Splitting wide tables optimally'. Together they form a unique fingerprint.

Cite this