The Network Solver
- Overview
- Getting Started
-
Syntax
-
DetailsInput Data for the Network SolverSolving over Subsets of Nodes and Links (Filters)Numeric LimitationsBiconnected Components and Articulation PointsCliqueConnected ComponentsCycleLinear Assignment (Matching)Minimum-Cost Network FlowMinimum CutMinimum Spanning TreeShortest PathTransitive ClosureTraveling Salesman ProblemMacro Variable _OROPTMODEL_
-
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
Subsections:
- 9.1 Articulation Points in a Terrorist Network
- 9.2 Cycle Detection for Kidney Donor Exchange
- 9.3 Linear Assignment Problem for Minimizing Swim Times
- 9.4 Linear Assignment Problem, Sparse Format versus Dense Format
- 9.5 Minimum Spanning Tree for Computer Network Topology
- 9.6 Transitive Closure for Identification of Circular Dependencies in a Bug Tracking System
- 9.7 Traveling Salesman Tour through US Capital Cities