An application of vertex packing to data analysis in the evaluation of pavement deterioration

  • Authors:

  • Eliane A Gattass;George L Nemhauser

  • Affiliations:

  • School of Operations Research and Industrial Engineering, 324 Upson Hall, Cornell University, Ithaca, NY 14853, U.S.A.;School of Operations Research and Industrial Engineering, 324 Upson Hall, Cornell University, Ithaca, NY 14853, U.S.A.

  • Venue:
  • Operations Research Letters
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

Abstract

The analysis of data concerning the deterioration of pavement over time yielded a problem of aggregating the data in a manner that preserved independence of the aggregated data points and maximized the number of points. We show that this problem can be modeled as a maximum cardinality vertex packing problem on a proper internal graph and thus can be solved very efficiently by a greedy algorithm.