Lopes, Isabel CristinaCarvalho, J. M. Valerio de2015-04-232015-04-2320101571-0653http://hdl.handle.net/10400.22/5826The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.engInterval graphMinimum interval completionMinimum fill-inconference object10.1016/j.endm.2010.05.074