<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03053340</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-04-23T03:04:47+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks</title>
            <author role="aut">
              <persName>
                <forename type="first">Fabio</forename>
                <surname>D’andreagiovanni</surname>
              </persName>
              <email type="md5">7b4bfc453df1016abf5d4ce28bd70272</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">fabio-dandreagiovanni</idno>
              <idno type="idhal" notation="numeric">741497</idno>
              <idno type="halauthorid" notation="string">38187-741497</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0872-3636</idno>
              <affiliation ref="#struct-389870"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hicham</forename>
                <surname>Lakhlef</surname>
              </persName>
              <email type="md5">58490e90ba2ca2c30911838f50dad9a0</email>
              <email type="domain">irisa.fr</email>
              <idno type="idhal" notation="numeric">1289011</idno>
              <idno type="halauthorid" notation="string">800133-1289011</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3005-9727</idno>
              <orgName ref="#struct-93027"/>
              <affiliation ref="#struct-389870"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Antonella</forename>
                <surname>Nardin</surname>
              </persName>
              <idno type="halauthorid">1280821-0</idno>
              <affiliation ref="#struct-302801"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Fabio</forename>
                <surname>D'Andreagiovanni</surname>
              </persName>
              <email type="md5">7b4bfc453df1016abf5d4ce28bd70272</email>
              <email type="domain">hds.utc.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-12-11 01:54:06</date>
              <date type="whenModified">2025-06-24 10:16:03</date>
              <date type="whenReleased">2020-12-11 08:39:34</date>
              <date type="whenProduced">2020-01</date>
              <date type="whenEndEmbargoed">2020-12-11</date>
              <ref type="file" target="https://hal.science/hal-03053340v1/document">
                <date notBefore="2020-12-11"/>
              </ref>
              <ref type="file" subtype="publisherPaid" n="1" target="https://hal.science/hal-03053340v1/file/DAndreagiovanni_etAl_DVBNetDesign_Algorithms2020.pdf" id="file-3053340-2686402">
                <date notBefore="2020-12-11"/>
              </ref>
              <ref type="externalLink" target="https://www.mdpi.com/1999-4893/13/1/27/pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="470916">
                <persName>
                  <forename>Fabio</forename>
                  <surname>D'Andreagiovanni</surname>
                </persName>
                <email type="md5">7b4bfc453df1016abf5d4ce28bd70272</email>
                <email type="domain">hds.utc.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03053340</idno>
            <idno type="halUri">https://hal.science/hal-03053340</idno>
            <idno type="halBibtex">dandreagiovanni:hal-03053340</idno>
            <idno type="halRefHtml">&lt;i&gt;Algorithms&lt;/i&gt;, 2020, 13 (1), pp.27. &lt;a target="_blank" href="https://dx.doi.org/10.3390/a13010027"&gt;&amp;#x27E8;10.3390/a13010027&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Algorithms, 2020, 13 (1), pp.27. &amp;#x27E8;10.3390/a13010027&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3053340-2686402"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-COMPIEGNE">Université de Technologie de Compiègne</idno>
            <idno type="stamp" n="HEUDIASYC" corresp="UNIV-COMPIEGNE">Laboratoire HEUDIASYC - Heuristique et Diagnostic des Systèmes Complexes</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="HDS_SCOP" corresp="HEUDIASYC">Sûreté, Communication et Optimisation</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Fabio</forename>
                    <surname>D’andreagiovanni</surname>
                  </persName>
                  <email type="md5">7b4bfc453df1016abf5d4ce28bd70272</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">fabio-dandreagiovanni</idno>
                  <idno type="idhal" notation="numeric">741497</idno>
                  <idno type="halauthorid" notation="string">38187-741497</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0872-3636</idno>
                  <affiliation ref="#struct-389870"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hicham</forename>
                    <surname>Lakhlef</surname>
                  </persName>
                  <email type="md5">58490e90ba2ca2c30911838f50dad9a0</email>
                  <email type="domain">irisa.fr</email>
                  <idno type="idhal" notation="numeric">1289011</idno>
                  <idno type="halauthorid" notation="string">800133-1289011</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3005-9727</idno>
                  <orgName ref="#struct-93027"/>
                  <affiliation ref="#struct-389870"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Antonella</forename>
                    <surname>Nardin</surname>
                  </persName>
                  <idno type="halauthorid">1280821-0</idno>
                  <affiliation ref="#struct-302801"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">8</idno>
                <idno type="halJournalId" status="VALID">98226</idno>
                <idno type="issn">1999-4893</idno>
                <title level="j">Algorithms</title>
                <imprint>
                  <publisher>MDPI</publisher>
                  <biblScope unit="volume">13</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">27</biblScope>
                  <date type="datePub">2020-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.3390/a13010027</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">ILP heuristics</term>
                <term xml:lang="en">matheuristics</term>
                <term xml:lang="en">tight linear relaxations</term>
                <term xml:lang="en">mixed integer linear programming</term>
                <term xml:lang="en">network optimization</term>
                <term xml:lang="en">antenna design</term>
                <term xml:lang="en">DVB-T</term>
                <term xml:lang="en">telecommunications</term>
              </keywords>
              <classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</classCode>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Because of the introduction and spread of the second generation of the Digital Video Broadcasting-Terrestrial standard (DVB-T2), already active television broadcasters and new broadcasters that have entered in the market will be required to (re)design their networks. This is generating a new interest for effective and efficient DVB optimization software tools. In this work, we propose a strengthened binary linear programming model for representing the optimal DVB design problem, including power and scheduling configuration, and propose a new matheuristic for its solution. The matheuristic combines a genetic algorithm, adopted to efficiently explore the solution space of power emissions of DVB stations, with relaxation-guided variable fixing and exact large neighborhood searches formulated as integer linear programming (ILP) problems solved exactly. Computational tests on realistic instances show that the new matheuristic performs much better than a state-of-the-art optimization solver, identifying solutions associated with much higher user coverage.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-389870" status="VALID">
          <idno type="IdRef">110410807</idno>
          <idno type="ISNI">0000 0004 0452 2471</idno>
          <idno type="RNSR">201220263C</idno>
          <idno type="ROR">https://ror.org/0075hvk77</idno>
          <orgName>Heuristique et Diagnostic des Systèmes Complexes [Compiègne]</orgName>
          <orgName type="acronym">Heudiasyc</orgName>
          <desc>
            <address>
              <addrLine>UTC, CS 60319 - 57 avenue de Landshut - 60203 Compiègne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.hds.utc.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93027" type="direct"/>
            <relation name="UMR7253" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-302801" status="VALID">
          <idno type="ISNI">0000 0001 2162 2106</idno>
          <idno type="ROR">https://ror.org/05vf0dg29</idno>
          <orgName>Università degli Studi Roma Tre = Roma Tre University</orgName>
          <orgName type="acronym">ROMA TRE</orgName>
          <date type="start">1992-01-01</date>
          <desc>
            <address>
              <addrLine>Via Ostiense, 133 - 00154 Rome</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://www.uniroma3.it/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-93027" status="VALID">
          <idno type="ROR">https://ror.org/04y5kwa70</idno>
          <orgName>Université de Technologie de Compiègne</orgName>
          <orgName type="acronym">UTC</orgName>
          <desc>
            <address>
              <addrLine>Université de Technologie de Compiègne - rue du Docteur Schweitzer- CS 60319 - 60203 Compiègne Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.utc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>