Search
Now showing items 1-1 of 1
A branch-and-price-and-cut method for computing an optimal bramble
(Elsevier, 2015)
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 ...
Share this page