The OPTNET Procedure
- Overview
-
Getting Started
-
SyntaxFunctional SummaryPROC OPTNET StatementBICONCOMP StatementCLIQUE StatementCONCOMP StatementCYCLE StatementDATA_LINKS_VAR StatementDATA_MATRIX_VAR StatementDATA_NODES_VAR StatementLINEAR_ASSIGNMENT StatementMINCOSTFLOW StatementMINCUT StatementMINSPANTREE StatementPERFORMANCE StatementSHORTPATH StatementTRANSITIVE_CLOSURE StatementTSP Statement
-
DetailsGraph Input DataMatrix Input DataData Input OrderParallel ProcessingNumeric LimitationsSize LimitationsBiconnected Components and Articulation PointsCliqueConnected ComponentsCycleLinear Assignment (Matching)Minimum-Cost Network FlowMinimum CutMinimum Spanning TreeShortest PathTransitive ClosureTraveling Salesman ProblemMacro VariablesODS Table Names
-
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
Data Input Order
Many algorithms are sensitive to the order in which PROC OPTNET reads the data. If the order of the nodes or links is changed, either by you or by some parameter setting, the final result might change. In some cases, this difference is simply a permutation of identifiers (for example, connected components). In other cases, when you use discrete branching decisions (for example, the traveling salesman problem), the final result might be a local (or alternative) solution. Two parameters that could have such an effect are the STANDARDIZED_LABELS and NTHREADS= options. Both of these options can change the internal order of the nodes and links.