From a06ff64534815cbf702a3847a19443612d307b80 Mon Sep 17 00:00:00 2001 From: Jaron Kent-Dobias Date: Fri, 30 Sep 2022 10:55:55 +0200 Subject: Changed rbmp to use blossom algorithm. --- blossom5-v2.05.src/USAGE.TXT | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 blossom5-v2.05.src/USAGE.TXT (limited to 'blossom5-v2.05.src/USAGE.TXT') diff --git a/blossom5-v2.05.src/USAGE.TXT b/blossom5-v2.05.src/USAGE.TXT new file mode 100644 index 0000000..afe93cd --- /dev/null +++ b/blossom5-v2.05.src/USAGE.TXT @@ -0,0 +1,31 @@ +USAGE: ./blossom5 [options] + +At least one of the two flags below must be provided. +If both are provided, then edges in are added to the initial subset of edges for the geometric problem. + + -e read problem (list of edges) from file in DIMACS or blossom4 format + (see GRAPH1.TXT and GRAPH2.TXT for examples) + -g read geometric problem (list of 2D points) from file in TSPLIB format + +perfect matching parameters: + + -j do not use fractional jumpstart + -m# update duals by solving LP if the number of trees is smaller than # times node_num. + (# should belong to [0,1], default is 0.) + -d1 use SCC dual updates instead of CC + -d2 use dual updates with fixed delta instead of CC + -b update duals before processing a tree + -a update duals after processing a tree + +geometric matching parameters: + + -D do NOT add Delaunay triangulation to the initial subset of edges + -K# for each point, add # nearest neighbors to the initial subset of edges + -I do NOT add edges greedily to the initial subset of edges to make sure that a perfect matching exists + -T# use at most # iterations (or run until convergence, if #=0 - default) + +other options: + + -w save result to file + -c check complementary slackness conditions for non-geometric problem + -V no verbose -- cgit v1.2.3-70-g09d2