A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
From MaRDI portal
Publication:1626771
DOI10.1007/978-3-319-93031-2_34OpenAlexW2807385899MaRDI QIDQ1626771
Yanick Ouellet, Claude-Guy Quimper
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_34
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
A MinCumulative resource constraint ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem ⋮ Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited ⋮ Constraint propagation on GPU: a case study for the cumulative constraint ⋮ Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
This page was built for publication: A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
