Changeset 16233 for branches/2931_OR-Tools_LP_MIP/HeuristicLab.MathematicalOptimization/3.3/LinearProgramming/Algorithms/Solvers/GurobiSolver.cs
- Timestamp:
- 10/17/18 17:51:26 (6 years ago)
- Location:
- branches/2931_OR-Tools_LP_MIP/HeuristicLab.MathematicalOptimization/3.3/LinearProgramming/Algorithms/Solvers
- Files:
-
- 1 added
- 1 moved
Legend:
- Unmodified
- Added
- Removed
-
branches/2931_OR-Tools_LP_MIP/HeuristicLab.MathematicalOptimization/3.3/LinearProgramming/Algorithms/Solvers/GurobiSolver.cs
r16232 r16233 1 using HeuristicLab.Core; 1 using HeuristicLab.Common; 2 using HeuristicLab.Core; 2 3 using HeuristicLab.Data; 4 using HeuristicLab.MathematicalOptimization.LinearProgramming.Algorithms.Solvers.Base; 3 5 using HeuristicLab.Parameters; 4 6 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 5 7 6 namespace HeuristicLab.MathematicalOptimization.LinearProgramming.Algorithms { 8 namespace HeuristicLab.MathematicalOptimization.LinearProgramming.Algorithms.Solvers { 9 7 10 [Item("Gurobi", "Gurobi (http://www.gurobi.com/) must be installed and licenced.")] 8 11 [StorableClass] 9 public class GurobiSolver : Solver {12 public class GurobiSolver : ExternalIncrementalSolver { 10 13 11 14 public GurobiSolver() { 12 Parameters.Add(libraryNameParam = new FixedValueParameter<StringValue>(nameof(LibraryName), new StringValue("gurobi80.dll"))); 15 Parameters.Add(libraryNameParam = new FixedValueParameter<FileValue>(nameof(LibraryName), 16 new FileValue { FileDialogFilter = FileDialogFilter, Value = "gurobi80.dll" })); 17 } 18 19 protected GurobiSolver(GurobiSolver original, Cloner cloner) 20 : base(original, cloner) { 21 programmingTypeParam = cloner.Clone(original.programmingTypeParam); 13 22 } 14 23 … … 17 26 ? OptimizationProblemType.GUROBI_LINEAR_PROGRAMMING 18 27 : OptimizationProblemType.GUROBI_MIXED_INTEGER_PROGRAMMING; 28 29 public override bool SupportsPause => true; 30 public override bool SupportsStop => true; 19 31 } 20 32 }
Note: See TracChangeset
for help on using the changeset viewer.