نتایج جستجو برای: minimal cut set
تعداد نتایج: 856429 فیلتر نتایج به سال:
In optimization problems such as integer programs or their relaxations, one encounters feasible regions of the form {x ∈ R+ : Rx ∈ S} where R is a general real matrix and S ⊂ R is a specific closed set with 0 / ∈ S. For example, in a relaxation of integer programs introduced in [ALWW2007], S is of the form Z − b where b 6∈ Z . One would like to generate valid inequalities that cut off the infea...
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every vertex pair (s, t) ∈ B is disconnected in (V, E r X), generalizing wellknown efficient algorithms for enumerating all minimal s-t cuts, for a given pair s, t ∈ V of vertices. We also present an increme...
LetG = (V,E) be an undirected graph, and letB ⊆ V ×V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every vertex pair (s, t) ∈ B is disconnected in (V,ErX), generalizing well-known efficient algorithms for enumerating all minimal s-t cuts, for a given pair s, t ∈ V of vertices. We also present an incremental p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید