ULSAlgorithms 1.1.0-g3e5595996d
High-performance exact and heuristic algorithms for uncapacitated lot sizing
Loading...
Searching...
No Matches
CutSelectionPolicy.cs
Go to the documentation of this file.
2
3/// <summary>
4/// Selects which eligible violated cuts are inserted at one root-separation
5/// iteration.
6/// </summary>
8{
9 /// <summary>Add every unique violated cut.</summary>
11
12 /// <summary>
13 /// Add only the most violated candidate for each value of l.
14 /// </summary>
16
17 /// <summary>
18 /// Add the globally most violated candidates, limited by
19 /// MaximumCutsPerIteration.
20 /// </summary>
22
23 /// <summary>
24 /// Add the globally highest-efficacy candidates, limited by
25 /// MaximumCutsPerIteration.
26 /// </summary>
28}
CutSelectionPolicy
Selects which eligible violated cuts are inserted at one root-separation iteration.
@ TopByEfficacy
Add the globally highest-efficacy candidates, limited by MaximumCutsPerIteration.
@ MostViolatedPerL
Add only the most violated candidate for each value of l.
@ TopByViolation
Add the globally most violated candidates, limited by MaximumCutsPerIteration.