symphony(1) [debian man page]
SYMPHONY(1) General Commands Manual SYMPHONY(1) NAME
symphony - mixed-integer linear program (MILP) solver SYNOPSIS
symphony [ -hagrtbd ] [ -u ub ] [ -p procs ] [ -n rule ] [ -v level ] [ -s cands ] [ -c rule ] [ -k rule ] [ -m max ] [ -l pools ] [ -i iters ] [ -f parameter_file_name ] [-j 0/1] [-o tree_out_file] DESCRIPTION
This manual page briefly documents the symphony command. symphony is a generic MILP solver that can be invoked from the command line (through an interactive shell or in a batch mode), or by link- ing to the provided callable library. When no options are given symphony enters the interactive shell mode. Otherwise the program enters the batch mode, for which a summary of options is included below. OPTIONS
At a minimum, one must specify the name of the file to be read and solved. -h help -a no cut timeout -d enable graph drawing -g use cut generator -r do repricing in root -t trim the tree -b don't perform branch and cut -u ub use upper bound 'ub' -p procs allow 'procs' active nodes -n i use node selection rule 'i' -v i set verbosity to level 'i' -s cands use 'cands' candidates for strong branching -k i use rule 'i' to select child -m n allow a max of 'n' cuts to enter per iteration -e n allow a max of 'n' cut pools -l n k load balance level 'n' and iterations 'k' -i n allow a max of 'n' iterations in presolve -f file read parameters from parameter file 'file' -j 0/1 whether or not to generate cgl cuts -z n set diving threshold to 'n' -o file output vbc-like tree information to file 'file' Solver-specific switches: symphony [ -H ] [ -FL file ] -H help (solver-specific switches) -F model model should be read in from file 'model' (MPS format is assumed unless -D is also present) -L model LP format model should be read in from file 'model' -D data model is in AMPL format and data is in file 'data' SEE ALSO
For a complete description, see /usr/share/doc/coinor-libsymphony-doc/user-guide.pdf.gz in the coinor-libsymphony-doc package. AUTHOR
symphony was written by Ted Ralphs et.al. This manual page was written by Aramian Wasielak <aramian.wasielak@gmail.com>, based on "symphony -h" and clp.1, for the Debian project (but may be used by others). Jan 21, 2010 SYMPHONY(1)
Check Out this Related Man Page
CBC(1) General Commands Manual CBC(1) NAME
cbc - Cbc mixed integer programming solver SYNOPSIS
cbc [ options ] filename DESCRIPTION
This manual page documents briefly the cbc command. cbc -- Cbc (Coin-or branch and cut) is an open-source mixed integer programming solver written in C++. OPTIONS
When no options are given cbc enters the interactive command line mode. Otherwise the program enters a batch mode, for which a summary of options is included below. Note that the order of options in the command line of the cbc executable matter The command line of the cbc executable is parsed as if it were in the interactive mode. The take-away is that if your using the command line, and things aren't working as you think they should, try ordering the commands in the sequence you'd use if you were interactive mode. For a complete description, see /usr/share/doc/coinor-libbc-doc. - Read input from stdin instead of filename -csv The option "-csv <filename>" causes cbc to print one line of key output statics in commma separated format in a file named <file- name>. This option isn't currently included in the list of commands given by the "?" command in interactive mode. -threads <num_threads> Run cbc in parallel using <num_threads> many CPUs INTERACTIVE MODE
In interactive mode one command per line is expected (no leading -). ? lists all available commands <command>? gives list of possibilities, if only one + explanation <command>?? adds explanation, if only one fuller help <command> without value (where expected) gives current value <command> <value> sets value AVAILABLE COMMANDS
Double parameters: dualB(ound) dualT(olerance) primalT(olerance) primalW(eight) Branch and Cut double parameters: allow(ableGap) cuto(ff) inc(rement) inf(easibilityWeight) integerT(olerance) preT(olerance) ratio(Gap) sec(onds) Integer parameters: cpp(Generate) force(Solution) idiot(Crash) maxF(actor) maxIt(erations) output(Format) slog(Level) sprint(Crash) Branch and Cut integer parameters: cutD(epth) log(Level) maxN(odes) maxS(olutions) passC(uts) passF(easibilityPump) passT(reeCuts) pumpT(une) strong(Branching) trust(PseudoCosts) Keyword parameters: chol(esky) crash cross(over) direction dualP(ivot) error(sAllowed) keepN(ames) mess(ages) perturb(ation) presolve primalP(ivot) printi(ngOptions) scal(ing) Branch and Cut keyword parameters: clique(Cuts) combine(Solutions) cost(Strategy) cuts(OnOff) Dins DivingS(ome) DivingC(oefficient) DivingF(ractional) DivingG(uided) DivingL(ineSearch) DivingP(seudoCost) DivingV(ectorLength) feas(ibilityPump) flow(CoverCuts) gomory(Cuts) greedy(Heuristic) heur(isticsOnOff) knapsack(Cuts) lift(AndProjectCuts) local(TreeSearch) mixed(IntegerRoundingCuts) node(Strategy) preprocess probing(Cuts) reduce(AndSplitCuts) residual(CapacityCuts) Rens Rins round(ingHeuristic) sos(Options) two(MirCuts) Actions or string parameters: allS(lack) barr(ier) basisI(n) basisO(ut) directory dirSample dirNetlib dirMiplib dualS(implex) either(Simplex) end exit export help import initialS(olve) max(imize) min(imize) netlib netlibD(ual) netlibP(rimal) netlibT(une) primalS(implex) printM(ask) quit restore(Model) saveM(odel) saveS(olution) solu(tion) stat(istics) stop unitTest userClp Branch and Cut actions: branch(AndCut) doH(euristic) miplib prio(rityIn) solv(e) strengthen userCbc SEE ALSO
glpsol(1),dsdp5(1),clp(1) This program is fully documented in the accompanying html documentation which can be found in /usr/share/doc/coinor-libcbc-doc if the coinor-libcbc-doc package is installed. AUTHOR
cbc was written by John J. Forrest <jjforre@us.ibm.com> et.al. This manual page was written by Soeren Sonnenburg <sonne@debian.org>, for the Debian project (but may be used by others). August 26, 2009 CBC(1)