Initializing help system before first use

CUTSTRATEGY

Description
Branch and Bound: This specifies the general cut strategy in terms of limits on the number of cuts and of non-zero cut elements that can be added to the problem. A more aggressive cut strategy, allowing a greater number of cuts and non-zero cut elemenets in the subproblems, will typically result in fewer nodes to be explored, but at the cost of a slowdown in the node throughput (i.e., the more cuts are added, the harder it becomes to solve the LP relaxation of each node subproblem). On the other hand, a more conservative cut strategy will typically improve the node throughput, but at the cost of more nodes to be explored for solving the problem.
Type
Integer
Topic areas
Cuts, Branch and Bound Search
Values
-1 
Automatic selection of the cut strategy.
0 
No cuts.
1 
Conservative cut strategy.
2 
Moderate cut strategy.
3 
Aggressive cut strategy.
Default value
-1
Affects routines
XPRSmipoptimize ( MIPOPTIMIZE).
Category
Control

Parent Topic Control Parameters

© 2001-2026 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.