@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00944382v1> a dcat:Dataset ;
    dct:description """
              This report focuses on the challenging issue of designing exponential algorithms for scheduling problems. Despite a growing literature dealing with such algorithms for other combinatorial optimization problems, it is still a recent research area in scheduling theory and few results are known. An exponential algorithm solves optimaly an NP-hard optimization problem with a worst-case time, or space, complexity that can be established and, which is lower than the one of a brute-force search. By the way, an exponential algorithm provides information about the complexity in the worst-case of solving a given NP-hard problem. In this report, we provide a survey of the few results known on schduling problems as well as some techniques for deriving exponential algorithms. In a second part we focus on some basic scheduling problems for which we propose exponential algorithms.
            """ ;
    dct:identifier "hal-00944382" ;
    dct:issued "2026-05-06T23:45:12.234438"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-06T23:45:12.234443"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Exponential Algorithms for Scheduling Problems" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00944382v1/resource/2f4084cf-e7d8-452a-a94e-caf26f2af033> ;
    dcat:keyword "exponential-algorithms",
        "infoeu-reposemanticsreport",
        "infoinfo-rocomputer-science-csoperations-research-mathoc",
        "reports",
        "scheduling" ;
    dcat:landingPage <https://hal.science/hal-00944382> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00944382v1/resource/2f4084cf-e7d8-452a-a94e-caf26f2af033> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-06T23:45:12.242601"^^xsd:dateTime ;
    dct:modified "2026-05-06T23:45:12.218787"^^xsd:dateTime ;
    dct:title "Exponential Algorithms for Scheduling Problems" ;
    dcat:accessURL <https://hal.science/hal-00944382> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00944382> a foaf:Document .