Results File
Dataset
File Header
Author(s):Petr Vil?m
Reference:Vil?m, P. (2011). Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, 16. https://doi.org/10.1007/978-3-642-21311-3_22
Date:2011
Hardware / software:Intel(R) Core(TM)2 Duo CPU T9400 on 2.53GHz
Stop criteria:time limit for each improvement step is 60 seconds
Submission date:2021
Statistics
Nothing changed since there are no new lower bounds, upper bounds nor optimal solutions.
Instances: 8
Lower Bounds: 8
- Average deviations:
- over CPM: 52.29%
- below best LB: 1.04%
- below best UB: 4.95%
- Best Known: 2 (25.00%)
- Closed (using best UBs): 0 (0.00%)
- Sum of time units: 749
- Open time units:
- to LBs: 8 (1.06%)
- to UBs: 39 (4.95%)
Instances: 8
Lower Bounds: 8
- Average deviations:
- over CPM: 52.29%
- below best LB: 1.04%
- below best UB: 4.95%
- Best Known: 2 (25.00%)
- Closed (using best UBs): 0 (0.00%)
- Sum of time units: 749
- Open time units:
- to LBs: 8 (1.06%)
- to UBs: 39 (4.95%)
Date