Previous Page
|
Next Page
Details
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_ADJ_MATRIX_VAR Statement
DATA_LINKS_VAR Statement
DATA_MATRIX_VAR Statement
DATA_NODES_VAR Statement
LINEAR_ASSIGNMENT Statement
MINCOSTFLOW Statement
MINCUT Statement
MINSPANTREE Statement
SHORTPATH Statement
TRANSITIVE_CLOSURE Statement
TSP Statement
Details
Graph Input Data
Matrix Input Data
Biconnected Components and Articulation Points
Clique
Connected Components
Cycle
Linear Assignment (Matching)
Minimum Cut
Minimum Spanning Tree
Minimum-Cost Network Flow
Shortest Path
Transitive Closure
Traveling Salesman Problem
Macro Variable _OROPTNET_
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
Details: OPTNET Procedure
Graph Input Data
Matrix Input Data
Biconnected Components and Articulation Points
Clique
Connected Components
Cycle
Linear Assignment (Matching)
Minimum Cut
Minimum Spanning Tree
Minimum-Cost Network Flow
Shortest Path
Transitive Closure
Traveling Salesman Problem
Macro Variable _OROPTNET_
Previous Page
|
Next Page
|
Top of Page
Copyright © SAS Institute Inc. All Rights Reserved.
Previous Page
|
Next Page
|
Top of Page