Changeset 12708 for stable/HeuristicLab.Problems.LinearAssignment/3.3
- Timestamp:
- 07/10/15 12:11:55 (9 years ago)
- Location:
- stable
- Files:
-
- 3 edited
-
. (modified) (1 prop)
-
HeuristicLab.Problems.LinearAssignment/3.3/HungarianAlgorithm.cs (modified) (1 diff)
-
HeuristicLab.Problems.LinearAssignment/3.3/LinearAssignmentProblem.cs (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
stable
- Property svn:mergeinfo changed
/trunk/sources merged: 12305,12393,12397-12401,12504,12506,12512,12622,12649,12664
- Property svn:mergeinfo changed
-
stable/HeuristicLab.Problems.LinearAssignment/3.3/HungarianAlgorithm.cs
r12009 r12708 35 35 /// </summary> 36 36 [Item("Hungarian Algorithm", "The Hungarian algorithm can be used to solve the linear assignment problem in O(n^3). It is also known as the Kuhn–Munkres algorithm or Munkres assignment algorithm.")] 37 [Creatable( "Algorithms")]37 [Creatable(CreatableAttribute.Categories.SingleSolutionAlgorithms, Priority = 170)] 38 38 [StorableClass] 39 39 public sealed class HungarianAlgorithm : EngineAlgorithm, IStorableContent { -
stable/HeuristicLab.Problems.LinearAssignment/3.3/LinearAssignmentProblem.cs
r12009 r12708 34 34 namespace HeuristicLab.Problems.LinearAssignment { 35 35 [Item("Linear Assignment Problem", "In the linear assignment problem (LAP) an assignment of workers to jobs has to be found such that each worker is assigned to exactly one job, each job is assigned to exactly one worker and the sum of the resulting costs is minimal (or maximal).")] 36 [Creatable( "Problems")]36 [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 130)] 37 37 [StorableClass] 38 38 public sealed class LinearAssignmentProblem : SingleObjectiveHeuristicOptimizationProblem<ILAPEvaluator, IPermutationCreator>, IStorableContent {
Note: See TracChangeset
for help on using the changeset viewer.
