The Network Solver
- Overview
- Getting Started
-
Syntax
-
DetailsInput Data for the Network SolverSolving over Subsets of Nodes and Links (Filters)Numeric LimitationsBiconnected Components and Articulation PointsCliqueConnected ComponentsCycleLinear Assignment (Matching)Minimum-Cost Network FlowMinimum CutMinimum Spanning TreeShortest PathTransitive ClosureTraveling Salesman ProblemMacro Variable _OROPTMODEL_
-
ExamplesArticulation Points in a Terrorist NetworkCycle Detection for Kidney Donor ExchangeLinear Assignment Problem for Minimizing Swim TimesLinear Assignment Problem, Sparse Format versus Dense FormatMinimum Spanning Tree for Computer Network TopologyTransitive Closure for Identification of Circular Dependencies in a Bug Tracking SystemTraveling Salesman Tour through US Capital Cities
- References
-
SOLVE WITH NETWORK /
General and Diagnostic Options:
<GRAPH_DIRECTION=DIRECTED | UNDIRECTED >
<INCLUDE_SELFLINK >
<LOGFREQ=number >
<LOGLEVEL=number | string >
<MAXTIME=number >
<TIMETYPE=number | string >Data Input and Output Options:
<LINKS=( suboptions ) >
<NODES=( suboptions ) >
<OUT=( suboptions ) >
<SUBGRAPH=( suboptions ) >Algorithm Options:
<BICONCOMP<=() > >
<CLIQUE<=( suboption ) > >
<CONCOMP<=( suboption ) > >
<CYCLE<=( suboptions ) > >
<LINEAR_ASSIGNMENT<=() > >
<MINCOSTFLOW<=() > >
<MINCUT<=( suboptions ) > >
<MINSPANTREE<=() > >
<SHORTPATH<=( suboptions ) > >
<TRANSITIVE_CLOSURE<=() > >
<TSP<=( suboptions ) > > ;
There are three types of SOLVE WITH NETWORK statement options:
-
General and diagnostic options have the same meaning for multiple algorithms.
-
Data input and output options, such as the LINKS=, NODES=, and OUT= options, control the names of the sets and variables that the network solver uses to build the graph and that the algorithms use for output.
-
Algorithm options select an algorithm to run, and where available, provide further algorithm-specific configuration directives.
The section Functional Summary provides a quick reference for each of the suboptions for each option. Each option is then described in more detail in its own section, in alphabetical order.