[ Reference Manual | Alphabetic Index ]

library(all_min_cuts_eplex)

Mixed integer programming solution for generating all minimum-cost cuts

Predicates

all_min_cuts_eplex(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MinCuts, -MinCutEdges)
MIP algorithm for generating all minimum-cost cuts
all_min_cuts_eplex(+Graph, +CapacityArg, +SourceNode, +SinkNode, +Limit, -MaxFlowValue, -MinCuts, -MinCutEdges)
MIP algorithm for generating all minimum-cost cuts, with a limit for max allowed number of generated cuts

Description

Mixed integer programming solution for generating all minimum-cost cuts between given source and sink nodes. This formulation was used as a comparison algorithm in the experimental section of [Norman D. Curet, Jason DeVinney, Matthew E. Gaston. An efficient network flow code for finding all minimum cost s-t cutsets. Computers & Operations Research 29 (2002) 205-219]. The idea is to iteratively solve dual max flow problem, and at each iteration, post an additional contraint to avoid repeating the same cuts.

About


Generated from all_min_cuts_eplex.eci on 2017-07-09 15:37