• Contents
  • About
  • Credits
    • Documentation
    • Software
    • Support Groups
  • What’s New in SAS/OR 12.1
    • Overview
      • Highlights of Enhancements in SAS/OR 12.1
    • The CLP Procedure
    • The DTREE, GANTT, and NETDRAW Procedures
    • Supporting Technologies for Optimization
    • PROC OPTMODEL: Nonlinear Optimization
    • Linear Optimization with PROC OPTMODEL and PROC OPTLP
    • Mixed Integer Linear Optimization with PROC OPTMODEL and PROC OPTMILP
    • The Decomposition Algorithm
    • Setting the Cutting Plane Strategy
    • Conflict Search
    • PROC OPTMILP: Option Tuning
    • PROC OPTMODEL: The SUBMIT Block
    • Network Optimization with PROC OPTNET
    • SAS Simulation Studio 12.1
  • The OPTNET Procedure
    • Overview: OPTNET Procedure
    • Getting Started: OPTNET Procedure
      • Road Network Shortest Path
    • Syntax: OPTNET Procedure
      • 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: 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_
    • Examples: OPTNET Procedure
      • 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


ProductRelease
SAS/OR12.1
Type
Usage and Reference
Copyright Date
August 2012
Last Updated
28Aug2012