A. Marín
Spanning trees on graphs usually aim to optimize an objective which depends on the
edges weights. But there are still some problems in the field where the goal is to
identify spanning trees with a given structure, usually depending on the degrees of
the nodes. For this kind of problems we present a new family of Integer Programming
formulations, closely related to set packing problems, whose polyhedral structures
are analyzed.
Keywords: Discrete location, trees
Scheduled
T4 Location 3
October 1, 2015 5:00 PM
Salón de actos
