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.
1
namespace
ULSAlgorithms.CuttingPlanes
;
2
3
/// <summary>
4
/// Selects which eligible violated cuts are inserted at one root-separation
5
/// iteration.
6
/// </summary>
7
public
enum
CutSelectionPolicy
8
{
9
/// <summary>Add every unique violated cut.</summary>
10
AllViolated
= 0,
11
12
/// <summary>
13
/// Add only the most violated candidate for each value of l.
14
/// </summary>
15
MostViolatedPerL
= 1,
16
17
/// <summary>
18
/// Add the globally most violated candidates, limited by
19
/// MaximumCutsPerIteration.
20
/// </summary>
21
TopByViolation
= 2,
22
23
/// <summary>
24
/// Add the globally highest-efficacy candidates, limited by
25
/// MaximumCutsPerIteration.
26
/// </summary>
27
TopByEfficacy
= 3
28
}
ULSAlgorithms.CuttingPlanes
Definition
CutCoefficient.cs:1
ULSAlgorithms.CuttingPlanes.CutSelectionPolicy
CutSelectionPolicy
Selects which eligible violated cuts are inserted at one root-separation iteration.
Definition
CutSelectionPolicy.cs:8
ULSAlgorithms.CuttingPlanes.CutSelectionPolicy.TopByEfficacy
@ TopByEfficacy
Add the globally highest-efficacy candidates, limited by MaximumCutsPerIteration.
Definition
CutSelectionPolicy.cs:27
ULSAlgorithms.CuttingPlanes.CutSelectionPolicy.AllViolated
@ AllViolated
Add every unique violated cut.
Definition
CutSelectionPolicy.cs:10
ULSAlgorithms.CuttingPlanes.CutSelectionPolicy.MostViolatedPerL
@ MostViolatedPerL
Add only the most violated candidate for each value of l.
Definition
CutSelectionPolicy.cs:15
ULSAlgorithms.CuttingPlanes.CutSelectionPolicy.TopByViolation
@ TopByViolation
Add the globally most violated candidates, limited by MaximumCutsPerIteration.
Definition
CutSelectionPolicy.cs:21
src
ULSAlgorithms
CuttingPlanes
CutSelectionPolicy.cs
Generated by
1.17.0