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
References
-
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall.
-
Applegate, D. L., Bixby, R. E., Chvátal, V., and Cook, W. J. (2006). The Traveling Salesman Problem: A Computational Study. Princeton, NJ: Princeton University Press.
-
Bron, C., and Kerbosch, J. (1973). “Algorithm 457: Finding All Cliques of an Undirected Graph.” Communications of the ACM 16:48–50.
-
Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introduction to Algorithms. Cambridge, MA, and New York: MIT Press and McGraw-Hill.
-
Google (2011). “Google Maps.” Accessed March 16, 2011. http://maps.google.com.
-
Harley, E. R. (2003). Graph Algorithms for Assembling Integrated Genome Maps. Ph.D. diss., University of Toronto.
-
Johnson, D. B. (1975). “Finding All the Elementary Circuits of a Directed Graph.” SIAM Journal on Computing 4:77–84.
-
Jonker, R., and Volgenant, A. (1987). “A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems.” Computing 38:325–340.
-
Krebs, V. (2002). “Uncloaking Terrorist Networks.” First Monday 7. http://www.firstmonday.org/issues/issue7_4/krebs/.
-
Kruskal, J. B. (1956). “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem.” Proceedings of the American Mathematical Society 7:48–50.
-
Kumar, R., and Li, H. (1994). “On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound.” http://home.eng.iastate.edu/~rkumar/PUBS/atsp.pdf.
-
Stoer, M., and Wagner, F. (1997). “A Simple Min-Cut Algorithm.” Journal of the Association for Computing Machinery 44:585–591.
-
Tarjan, R. E. (1972). “Depth-First Search and Linear Graph Algorithms.” SIAM Journal on Computing 1:146–160.
-
Willingham, V. (2009). “Massive Transplant Effort Pairs 13 Kidneys to 13 Patients.” CNN Health. Accessed March 16, 2011. http://www.cnn.com/2009/HEALTH/12/14/kidney.transplant/index.html.