Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Instances/BPPData.cs @ 13365

Last change on this file since 13365 was 13032, checked in by gkronber, 9 years ago

#1966:

  • removed unused using
  • added/updated license headers
File size: 1.8 KB
RevLine 
[9348]1#region License Information
2/* HeuristicLab
[13032]3 * Copyright (C) 2002-2015 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[9348]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
22
[13032]23
[9348]24namespace HeuristicLab.Problems.Instances {
25  /// <summary>
26  /// Describes instances of the regular two dimensional bin packing problem (2DBPP).
27  /// </summary>
28  public class BPPData {
29    /// <summary>
30    /// The name of the instance
31    /// </summary>
32    public string Name { get; set; }
33    /// <summary>
34    /// Optional! The description of the instance
35    /// </summary>
36    public string Description { get; set; }
37
38    /// <summary>
39    /// The number of items.
40    /// </summary>
41    public int Items { get; set; }
42    /// <summary>
43    /// The measures of the bin.
44    /// </summary>
45    public int[] BinMeasures { get; set; }
46    /// <summary>
47    /// The measures of the items.
48    /// </summary>
49    public int[][] ItemMeasures { get; set; }
50
51    /// <summary>
52    /// Optional! The quality of the best-known solution.
53    /// </summary>
54    public double? BestKnownQuality { get; set; }
55  }
56}
Note: See TracBrowser for help on using the repository browser.