The OPTNET Procedure
- Overview
-
Getting Started
-
SyntaxFunctional SummaryPROC OPTNET StatementBICONCOMP StatementCLIQUE StatementCONCOMP StatementCYCLE StatementDATA_ADJ_MATRIX_VAR StatementDATA_LINKS_VAR StatementDATA_MATRIX_VAR StatementDATA_NODES_VAR StatementLINEAR_ASSIGNMENT StatementMINCOSTFLOW StatementMINCUT StatementMINSPANTREE StatementSHORTPATH StatementTRANSITIVE_CLOSURE StatementTSP Statement
-
Details
-
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
Functional Summary
Table 2.2 summarizes the statements and options available with PROC OPTNET.
Table 2.2: Functional Summary
|
Description |
Option |
|---|---|
|
Input |
|
|
Specifies the link data set (as an adjacency matrix) |
|
|
Specifies the link data set |
|
|
Specifies the matrix data set |
|
|
Specifies the node data set |
|
|
Specifies the node subset data set |
|
|
Output |
|
|
Specifies the link output data set |
|
|
Specifies the node output data set |
|
|
Options |
|
|
Specifies the graph direction |
|
|
Specifies the internal graph format |
|
|
Includes self-links |
|
|
Specifies the overall log level |
|
|
Specifies whether time units are in CPU time or real time |
|
|
Data Input Statements |
|
|
Specifies the data set variable names for adjacency matrix |
|
|
Specifies the data set variable name for the from nodes |
|
|
Specifies the data set variable name for the link flow lower bounds |
|
|
Specifies the data set variable name for the to nodes |
|
|
Specifies the data set variable name for the link flow upper bounds |
|
|
Specifies the data set variable name for the link weights |
|
|
Specifies the data set variable names for the matrix |
|
|
Specifies the data set variable name for the nodes |
|
|
Specifies the data set variable name for node weights |
|
|
Specifies the data set variable name for auxiliary node weights |
|
|
Algorithm Statements |
|
|
Specifies the log level for biconnected components |
|
|
Specifies the log level for clique calculations |
|
|
Specifies the maximum number of cliques to return during clique calculations |
|
|
Specifies the maximum amount of time to spend calculating cliques |
|
|
Specifies the output data set for cliques |
|
|
Specifies the algorithm to use for connected components |
|
|
Specifies the log level for connected components |
|
|
Specifies the log level for the cycle algorithm |
|
|
Specifies the maximum number of cycles to return during cycle calculations |
|
|
Specifies the maximum length for the cycles found |
|
|
Specifies the maximum link weight for the cycles found |
|
|
Specifies the maximum node weight for the cycles found |
|
|
Specifies the maximum amount of time to spend calculating cycles |
|
|
Specifies the minimum length for the cycles found |
|
|
Specifies the minimum link weight for the cycles found |
|
|
Specifies the minimum node weight for the cycles found |
|
|
Specifies the mode for the cycle calculations |
|
|
Specifies the output data set for cycles |
|
|
Specifies the data set variable names for the linear assignment identifiers |
|
|
Specifies the log level for the linear assignment algorithm |
|
|
Specifies the output data set for linear assignment |
|
|
Specifies the data set variable names for costs (or weights) |
|
|
Specifies the iteration log frequency |
|
|
Specifies the log level for the minimum-cost network flow algorithm |
|
|
Specifies the maximum amount of time to spend calculating the optimal flow |
|
|
Specifies the log level for the minimum cut algorithm |
|
|
Specifies the maximum number of cuts to return from the algorithm |
|
|
Specifies the maximum weight of the cuts to return from the algorithm |
|
|
Specifies the output data set for minimum cut |
|
|
Specifies the log level for the minimum spanning tree algorithm |
|
|
Specifies the output data set for minimum spanning tree |
|
|
Specifies the iteration log frequency (nodes) |
|
|
Specifies the log level for shortest paths |
|
|
Specifies the output data set for shortest paths |
|
|
Specifies the output data set for shortest path summaries |
|
|
Specifies the type of output for shortest paths results |
|
|
Specifies the sink node for shortest paths calculations |
|
|
Specifies the source node for shortest paths calculations |
|
|
Specifies whether to use weights in calculating shortest paths |
|
|
Specifies the data set variable name for the auxiliary link weights |
|
|
Specifies the log level for transitive closure |
|
|
Specifies the output data set for transitive closure results |
|
|
Specifies the stopping criterion based on the absolute objective gap |
|
|
Specifies the cutoff value for branch-and-bound node removal |
|
|
Specifies the overall cut strategy level |
|
|
Emphasizes feasibility or optimality |
|
|
Specifies the initial and primal heuristics level |
|
|
Specifies the maximum allowed difference between an integer variable’s value and an integer |
|
|
Specifies the frequency of printing the branch-and-bound node log |
|
|
Specifies the log level for the traveling salesman algorithm |
|
|
Specifies the maximum number of branch-and-bound nodes to be processed |
|
|
Specifies the maximum number of solutions to be found |
|
|
Specifies the maximum amount of time to spend in the algorithm |
|
|
Specifies whether to use a mixed-integer linear programming solver |
|
|
Specifies the branch-and-bound node selection strategy |
|
|
Specifies the output data set for traveling salesman |
|
|
Specifies the stopping criterion that is based on relative objective gap |
|
|
Specifies the number of simplex iterations to be performed on each variable in the strong branching strategy |
|
|
Specifies the number of candidates for the strong branching strategy |
|
|
Specifies the stopping criterion based on the target objective value |
|
|
Specifies the rule for selecting branching variable |
|
Table 2.3 lists the valid input formats, GRAPH_DIRECTION= values, and GRAPH_INTERNAL_FORMAT= values for each statement in the OPTNET procedure.
Table 2.3: Supported Input Formats and Graph Types by Statement
|
Input Format |
DIRECTION |
INTERNAL_FORMAT |
||||
|---|---|---|---|---|---|---|
|
Statement |
Graph |
Matrix |
UNDIRECTED |
DIRECTED |
THIN |
FULL |
|
X |
X |
X |
||||
|
X |
X |
X |
||||
|
DFS |
X |
X |
X |
X |
||
|
UF |
X |
X |
X |
X |
||
|
X |
X |
X |
X |
|||
|
X |
X |
X |
X |
|||
|
X |
X |
X |
X |
|||
|
X |
X |
X |
||||
|
X |
X |
X |
X |
|||
|
X |
X |
X |
X |
|||
|
X |
X |
X |
X |
|||
|
X |
X |
X |
||||
Table 2.4 indicates for each algorithm statement in the OPTNET procedure which output data set options you can specify and whether the algorithm populates the data sets specified by the OUT_NODES= and OUT_LINKS= options in the PROC OPTNET statement.
Table 2.4: Output Options by Statement
|
Statement |
OUT_NODES |
OUT_LINKS |
Algorithm Statement Options |
|---|---|---|---|
|
X |
X |
||
|
X |
|||
|
X |
|||
|
X |
|||
|
X |
|||
|
X |