Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/LOPData.cs @ 15541

Last change on this file since 15541 was 15541, checked in by fholzing, 6 years ago

#2864: CleanUp of old code, added LOP benchmark instances

File size: 2.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using System.Text;
26using System.Threading.Tasks;
27
28namespace HeuristicLab.Problems.Instances.Types
29{
30    /// <summary>
31    /// Describes instances of the Linear Ordering Problem (LOP).
32    /// </summary>
33    public class LOPData
34    {
35        /// <summary>
36        /// The name of the instance
37        /// </summary>
38        public string Name { get; set; }
39
40        /// <summary>
41        /// Optional! The description of the instance
42        /// </summary>
43        public string Description { get; set; }
44
45        /// <summary>
46        /// The size of the Matrix
47        /// </summary>
48        public int Dimension { get; set; }
49
50        /// <summary>
51        /// An NxN Matrix
52        /// </summary>
53        public double[,] Matrix { get; set; }
54
55        /// <summary>
56        /// Optional! The best known Permutation
57        /// </summary>
58        public int[] BestKnownPermutation { get; set; }
59
60        /// <summary>
61        /// Optional! The quality value of the <see cref="BestKnownPermutation"/>
62        /// </summary>
63        public double? BestKnownQuality { get; set; }
64    }
65}
Note: See TracBrowser for help on using the repository browser.