The Network Solver (Experimental)
- Overview
- Getting Started
-
Syntax
-
DetailsInput Data for the Network SolverSolving over Subsets of Nodes and Links (Filters)Biconnected 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:
- Input Data for the Network Solver
- Solving over Subsets of Nodes and Links (Filters)
- 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 Variable _OROPTMODEL_
The network solver uses a collection of specialized algorithms that optimize specific types of common problems. When you use the network solver, you specify variable arrays, numeric arrays, and sets, both to define an instance and to get solutions, without explicitly formulating objectives and constraints.