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

DOI10.1016/0167-6377(81)90018-3zbMath0487.90054OpenAlexW1986627973MaRDI QIDQ1165769

Eliane A. Gattass, Nemhauser, George I.

Publication date: 1981

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(81)90018-3

zbMATH Keywords

greedy algorithmdata analysisinterval graphspavement managementdeterioration of pavementmaximum cardinality vertex packing problemproper internal graph

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25) Traffic problems in operations research (90B20)

Related Items (3)

Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Interval graphs and related topics

Cites Work

• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An application of vertex packing to data analysis in the evaluation of pavement deterioration