Debian Codegraph @

SYMPHONY/Applications/MATCH/README

raw
1 ******************************************************************************
2 * SYMPHONY MATCH Application *
3 ******************************************************************************
4
5 The SYMPHONY MATCH application solves the standard matching problem. This
6 application is intended as an illustration of how to develop an application
7 with SYMPHONY. For a more detailed walkthrough of the development of this
8 solver, please see SYMPHONY/Doc/Walkthrough.pdf. See below for usage.
9
10 ******************************************************************************
11 * INSTALLATION *
12 ******************************************************************************
13
14 Please see the INSTALL file for a guide to compile SYMPHONY MATCH application.
15
16 *******************************************************************************
17 * USING THE SOLVER *
18 *******************************************************************************
19
20 Using the matching problem (MATCH), we try to pair the nodes(persons,jobs,etc)
21 with minimum cost. By pairing, we mean that each node is matched with exactly
22 one other node in return for a cost. The data file consists of a symmetric,
23 square matrix with rows and columns both representing the nodes and with the
24 cost entities of pairing the corresponding rows and columns. Note that the
25 diagonal of this matrix should be zero.
26
27 To execute the MATCH application, just specify the location of the data file
28 by typing "-F 'filename'" as an argument after the executable name. There is a
29 sample file called sample.mat that you can try to make sure the solver is
30 working. More data files may become available. Please check
31 http://www.branchandcut.org/MATCH/ for more information. The other user
32 defined parameters are the following:
33
34 -H: help (user switches)
35 -F file: problem instance data is in 'file'
36
37 You can also obtain the above list by tying the executable name followed by
38 "-H". There are a number of other (for now) undocumented parameters that can
39 be used to fine-tune the performance of the solver. These must be set in a
40 parameter file. The SYMPHONY User's Manual explains the use of the parameter
41 file.
42
43 Some of SYMPHONY's native parameters can also be set on the command
44 line. Below is a list of these parameters. This list can also be obtained by
45 typing the executable name with no command-line arguments. Note that all
46 SYMPHONY parameters are denoted by a lowercase letter. Note that there are
47 dozens of other parameters that can be set with the use of a parameter
48 file. These parameters are listed in the SYMPHONY User's Manual.
49
50 -h: help
51 -a: no cut timeout
52 -d: enable graph drawing
53 -g: use cut generator
54 -r: do repricing in root
55 -t: trim the tree
56 -b: don't perform branch and cut
57 -u ub: use upper bound 'ub'
58 -p procs: allow 'procs' active nodes
59 -n i: use node selection rule 'i'
60 -v i: set verbosity to level 'i'
61 -s cands: use 'cands' candidates for strong branching
62 -c i: use rule 'i' to compare candidates
63 -k i: use rule 'i' to select child
64 -m n: allow a max of 'n' cuts to enter per iteration
65 -e n: allow a max of 'n' cut pools
66 -l n k: load balance level 'n' and iterations 'k'
67 -i n: allow a max of 'n' iterations in presolve
68 -z n: set diving threshold to 'n'
69 -f file: read parameters from parameter file 'file'
70
71 AUTHORS
72
73 The SYMPHONY MATCH application was developed by Michael Trick
74 ([email protected]).
75
76 BUG REPORTS
77
78 Please submit bug reports at https://projects.coin-or.org/SYMPHONY