A GRASP Heuristic for the Minimum Binary Cost Tension Problem

Abstract

Hypermedia documents are composed of media objects (audio, video, text...), connected by a set of temporal constraints. The Minimum Binary Cost Tension Problem consists in maximizing the number of objects set at their ideal duration. We propose a hybrid GRASP / VND heuristic and a Path Relinking strategy to compute near-optimal solutions