Previous Page
|
Next Page

The OPTNET Procedure

Overview
Getting Started
Road Network Shortest Path
Syntax
Functional Summary PROC OPTNET Statement BICONCOMP Statement CLIQUE Statement CONCOMP Statement CYCLE Statement DATA_LINKS_VAR Statement DATA_MATRIX_VAR Statement DATA_NODES_VAR Statement LINEAR_ASSIGNMENT Statement MINCOSTFLOW Statement MINCUT Statement MINSPANTREE Statement PERFORMANCE Statement SHORTPATH Statement TRANSITIVE_CLOSURE Statement TSP Statement
Details
Graph Input Data Matrix Input Data Data Input Order Parallel Processing Numeric Limitations Size Limitations Biconnected Components and Articulation Points Clique Connected Components Cycle Linear Assignment (Matching)Minimum-Cost Network Flow Minimum Cut Minimum Spanning Tree Shortest Path Transitive Closure Traveling Salesman Problem Macro Variables ODS Table Names
Examples
Articulation Points in a Terrorist Network Cycle Detection for Kidney Donor Exchange Linear Assignment Problem for Minimizing Swim Times Linear Assignment Problem, Sparse Format versus Dense Format Minimum Spanning Tree for Computer Network Topology Transitive Closure for Identification of Circular Dependencies in a Bug Tracking System Traveling Salesman Tour through US Capital Cities
References

Examples: OPTNET Procedure

Subsections:

2.1 Articulation Points in a Terrorist Network
2.2 Cycle Detection for Kidney Donor Exchange
2.3 Linear Assignment Problem for Minimizing Swim Times
2.4 Linear Assignment Problem, Sparse Format versus Dense Format
2.5 Minimum Spanning Tree for Computer Network Topology
2.6 Transitive Closure for Identification of Circular Dependencies in a Bug Tracking System
2.7 Traveling Salesman Tour through US Capital Cities

Previous Page
|
Next Page
|
Top of Page