A branch-and-price-and-cut method for computing an optimal bramble


Given an undirected graph, a bramble is a set of connected subgraphs (called bramble elements) such that every pair of subgraphs either contains a common node, or such that an edge (i, j) exists with node i belonging to one subgraph and node j belonging to the other. In this paper, we examine the problem of finding the bramble number of a graph, along with… (More)
DOI: 10.1016/j.disopt.2015.09.005

8 Figures and Tables


  • Presentations referencing similar topics