Context Navigation

HeuristicLab.Problems.LinearAssignment

Timestamp:

03/03/17 11:41:43 (7 years ago)

Author:

gkronber

Message:

#2520

Location:

Files:

r13368	r14711
32	32	namespace HeuristicLab.Problems.LinearAssignment {
33	33	[Item("BestLAPSolutionAnalyzer", "Analyzes the best solution found.")]
34		[Storable~~Class~~("95EF016B-D75D-4CFF-95C5-FA08DDD50B4F")]
	34	[StorableType("95EF016B-D75D-4CFF-95C5-FA08DDD50B4F")]
35	35	public class BestLAPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, ISingleObjectiveOperator {
36	36	public bool EnabledByDefault { get { return true; } }

r13368	r14711
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	37	[Creatable(CreatableAttribute.Categories.SingleSolutionAlgorithms, Priority = 170)]
38		[Storable~~Class~~("42430F77-CCA4-4A72-933B-945770A5FA11")]
	38	[StorableType("42430F77-CCA4-4A72-933B-945770A5FA11")]
39	39	public sealed class HungarianAlgorithm : EngineAlgorithm, IStorableContent {
40	40	public string Filename { get; set; }

r13368	r14711
29	29	namespace HeuristicLab.Problems.LinearAssignment {
30	30	[Item("LAP Assignment", "Represents a solution to the LAP.")]
31		[Storable~~Class~~("2F7E790F-BA77-4689-A1BB-1B6ED9BC02E8")]
	31	[StorableType("2F7E790F-BA77-4689-A1BB-1B6ED9BC02E8")]
32	32	public sealed class LAPAssignment : Item, INotifyPropertyChanged, IStorableContent {
33	33	public string Filename { get; set; }

r13368	r14711
31	31	namespace HeuristicLab.Problems.LinearAssignment {
32	32	[Item("LAPEvaluator", "Evaluates a solution to the linear assignment problem.")]
33		[Storable~~Class~~("D58F39FD-C614-4E41-A555-52B277A0DF26")]
	33	[StorableType("D58F39FD-C614-4E41-A555-52B277A0DF26")]
34	34	public class LAPEvaluator : InstrumentedOperator, ILAPEvaluator {
35	35

r13368	r14711
35	35	[Item("Linear Assignment Problem (LAP)", "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	36	[Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 130)]
37		[Storable~~Class~~("AF707CB5-CB24-4E46-87FF-A4234D17B533")]
	37	[StorableType("AF707CB5-CB24-4E46-87FF-A4234D17B533")]
38	38	public sealed class LinearAssignmentProblem : SingleObjectiveHeuristicOptimizationProblem<ILAPEvaluator, IPermutationCreator>, IStorableContent {
39	39	public static readonly string CostsDescription = "The cost matrix that describes the assignment of rows to columns.";

r13368	r14711
31	31	namespace HeuristicLab.Problems.LinearAssignment {
32	32	[Item("LinearAssignmentProblemSolver", "Uses the hungarian algorithm to solve linear assignment problems.")]
33		[Storable~~Class~~("9AE29C0F-02CB-4906-AA61-1E0896CA007E")]
	33	[StorableType("9AE29C0F-02CB-4906-AA61-1E0896CA007E")]
34	34	public sealed class LinearAssignmentProblemSolver : SingleSuccessorOperator, ISingleObjectiveOperator {
35	35	private const int UNASSIGNED = -1;

Note: See TracChangeset for help on using the changeset viewer.