@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-00940949v1> a dcat:Dataset ;
    dct:description """
              Global Optimization and Mixed-Integer Nonlinear Programming problems such as min{f(x) | gL ≤ g(x) ≤ gU ∧ xL ≤ x ≤ xU ∧ ∀j ∈ Z (xj ∈ Z)}, where f : Rn → R, g : Rn → Rm, gL, gU ∈ Rm, xL, x, xU ∈ Rn and Z ⊆ {1, . . . , n},are usually solved to "-guaranteed approximation by the spatial Branch-and-Bound (sBB) algorithm [2], a variant of the usual Branch-and-Bound for dealing with nonlinear, possibly nonconvex f, g. Since the gap between the original problem P and its convex relaxation ¯ P is due both to integral variable restrictions being lifted as well as nonconvex functions being replaced by a convex relaxation, sBB is able to branch at continuous variables as well as integer ones. If ¯x solves ¯ P, the standard disjunction used at a node in the sBB search tree is xj ≤ ¯xj ∨xj ≥ ¯xj , the more usual one xj ≤ ⌊¯xj⌋∨xj ≥ ⌈¯xj⌉ being used only if j ∈ Z.
            """ ;
    dct:identifier "hal-00940949" ;
    dct:issued "2026-05-07T03:39:14.674561"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-07T03:39:14.674566"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "On the convergence of feasibility based bounds tightening" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00940949v1/resource/2ac011b2-bea4-4c80-b6f0-4a8178d75e03> ;
    dcat:keyword "conference-papers",
        "constraint-programming",
        "fixed-point",
        "global-optimization",
        "infoeu-reposemanticsconferenceobject",
        "lattice",
        "mathmath-ocmathematics-mathoptimization-and-control-mathoc",
        "minlp",
        "range-reduction",
        "spatial-branch-and-bound" ;
    dcat:landingPage <CTW%202010%2C%209th%20Cologne-Twente%20Workshop%20on%20Graphs%20and%20Combinatorial%20Optimization> .

<CTW%202010%2C%209th%20Cologne-Twente%20Workshop%20on%20Graphs%20and%20Combinatorial%20Optimization> a foaf:Document .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00940949v1/resource/2ac011b2-bea4-4c80-b6f0-4a8178d75e03> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-07T03:39:14.676435"^^xsd:dateTime ;
    dct:modified "2026-05-07T03:39:14.661789"^^xsd:dateTime ;
    dct:title "On the convergence of feasibility based bounds tightening" ;
    dcat:accessURL <https://enac.hal.science/hal-00940949> .

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