Previous Page
|
Next Page
Details
Previous Page
|
Next Page
The Mixed Integer Linear Programming Solver
Overview
Getting Started
Syntax
Functional Summary
MILP Solver Options
Details
Branch-and-Bound Algorithm
Controlling the Branch-and-Bound Algorithm
Presolve and Probing
Cutting Planes
Primal Heuristics
Node Log
Problem Statistics
Data Magnitude and Variable Bounds
Macro Variable OROPTMODEL
Examples
Scheduling
Multicommodity Transshipment Problem with Fixed Charges
Facility Location
Traveling Salesman Problem
References
Details: MILP Solver
Branch-and-Bound Algorithm
Controlling the Branch-and-Bound Algorithm
Presolve and Probing
Cutting Planes
Primal Heuristics
Node Log
Problem Statistics
Data Magnitude and Variable Bounds
Macro Variable _OROPTMODEL_
Previous Page
|
Next Page
|
Top of Page
Copyright © SAS Institute Inc. All rights reserved.
Previous Page
|
Next Page
|
Top of Page
