Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Francisco Barahona"'
Publikováno v:
OPERATIONS RESEARCH
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by form
Publikováno v:
Mathematics of Operations Research. 25:243-254
Given a graph G = (V, E) with nonnegative weights x(e) for each edge e, a partition inequality is of the form x(δ(S1,…,Sp)) ≥ ap + b. Here δ(S1,…,Sp) denotes the multicut defined by a partition S1,…,Sp of V. Partition inequalities arise as
Autor:
Francisco Barahona
Publikováno v:
Mathematics of Operations Research. 20:104-115
We given an algorithm for packing spanning trees in a graph G = (V, E), with capacities on the edges. The problem reduces to O(|V|2) maximum flow computations. The algorithm is based on Nash-Williams's proof of a min-max relation for this problem.
Publikováno v:
Mathematics of Operations Research. 10:340-358
The bipartite subgraph polytope PB(G) of a graph G = [V, E] is the convex hull of the incidence vectors of all edge sets of bipartite subgraphs of G. We show that all complete subgraphs of G of odd order and all so-called odd bicycle wheels contained