<?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-00942913</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-05-09T13:23:35+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On an extension of the Sort &amp; Search method with application to scheduling theory</title>
            <author role="aut">
              <persName>
                <forename type="first">Christophe</forename>
                <surname>Lenté</surname>
              </persName>
              <email type="md5">b6057198d60b0b9a82ecd8b036e7df36</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="numeric">868460</idno>
              <idno type="halauthorid" notation="string">450409-868460</idno>
              <idno type="IDREF">https://www.idref.fr/059806117</idno>
              <orgName ref="#struct-300298"/>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mathieu</forename>
                <surname>Liedloff</surname>
              </persName>
              <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
              <email type="domain">univ-orleans.fr</email>
              <idno type="idhal" notation="string">mathieu-liedloff</idno>
              <idno type="idhal" notation="numeric">2195</idno>
              <idno type="halauthorid" notation="string">10248-2195</idno>
              <idno type="ARXIV">https://arxiv.org/a/http://arxiv.org/a/liedloff_m_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2518-606X</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=NGFc_JYAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/121018210</idno>
              <affiliation ref="#struct-1625"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ameur</forename>
                <surname>Soukhal</surname>
              </persName>
              <email type="md5">98847d27c96d257236bfea56e35852f5</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">ameur-soukhal</idno>
              <idno type="idhal" notation="numeric">868462</idno>
              <idno type="halauthorid" notation="string">450411-868462</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>T'kindt</surname>
              </persName>
              <email type="md5">bd91ec955babf6b13971d7ca6aa5b7fb</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">vincent-tkindt</idno>
              <idno type="idhal" notation="numeric">8188</idno>
              <idno type="halauthorid" notation="string">2995821-8188</idno>
              <idno type="IDREF">https://www.idref.fr/073272302</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7440-2980</idno>
              <affiliation ref="#struct-389674"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Mathieu</forename>
                <surname>Liedloff</surname>
              </persName>
              <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
              <email type="domain">univ-orleans.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-02-06 16:52:19</date>
              <date type="whenModified">2025-11-04 17:34:07</date>
              <date type="whenReleased">2014-02-06 16:52:19</date>
              <date type="whenProduced">2013</date>
              <ref type="externalLink" target="https://doi.org/10.1016/j.tcs.2013.05.023"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="146190">
                <persName>
                  <forename>Mathieu</forename>
                  <surname>Liedloff</surname>
                </persName>
                <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
                <email type="domain">univ-orleans.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00942913</idno>
            <idno type="halUri">https://hal.science/hal-00942913</idno>
            <idno type="halBibtex">lente:hal-00942913</idno>
            <idno type="halRefHtml">&lt;i&gt;Theoretical Computer Science&lt;/i&gt;, 2013, 511, pp.13-22. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.tcs.2013.05.023"&gt;&amp;#x27E8;10.1016/j.tcs.2013.05.023&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Theoretical Computer Science, 2013, 511, pp.13-22. &amp;#x27E8;10.1016/j.tcs.2013.05.023&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TOURS">Université François Rabelais</idno>
            <idno type="stamp" n="UNIV-ORLEANS">Université d'Orléans</idno>
            <idno type="stamp" n="ENSI-BOURGES">Ecole Nationale Supérieure d'Ingénieurs de Bourges</idno>
            <idno type="stamp" n="MSL">Modelisation Systemes Langages</idno>
            <idno type="stamp" n="MSL-THESE">Modelisation Systemes Langages</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="ROOT-TOURS" corresp="LIFAT">Équipe Recherche Opérationnelle, Ordonnancement et Transport du Laboratoire d’Informatique de l’Université de Tours</idno>
            <idno type="stamp" n="LIFAT">Laboratoire d'Informatique Fondamentale et Appliquée de Tours</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="INSA-CVL">INSA CENTRE VAL DE LOIRE</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">On an extension of the Sort &amp; Search method with application to scheduling theory</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Christophe</forename>
                    <surname>Lenté</surname>
                  </persName>
                  <email type="md5">b6057198d60b0b9a82ecd8b036e7df36</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="numeric">868460</idno>
                  <idno type="halauthorid" notation="string">450409-868460</idno>
                  <idno type="IDREF">https://www.idref.fr/059806117</idno>
                  <orgName ref="#struct-300298"/>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mathieu</forename>
                    <surname>Liedloff</surname>
                  </persName>
                  <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
                  <email type="domain">univ-orleans.fr</email>
                  <idno type="idhal" notation="string">mathieu-liedloff</idno>
                  <idno type="idhal" notation="numeric">2195</idno>
                  <idno type="halauthorid" notation="string">10248-2195</idno>
                  <idno type="ARXIV">https://arxiv.org/a/http://arxiv.org/a/liedloff_m_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2518-606X</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=NGFc_JYAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/121018210</idno>
                  <affiliation ref="#struct-1625"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ameur</forename>
                    <surname>Soukhal</surname>
                  </persName>
                  <email type="md5">98847d27c96d257236bfea56e35852f5</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">ameur-soukhal</idno>
                  <idno type="idhal" notation="numeric">868462</idno>
                  <idno type="halauthorid" notation="string">450411-868462</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>T'kindt</surname>
                  </persName>
                  <email type="md5">bd91ec955babf6b13971d7ca6aa5b7fb</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">vincent-tkindt</idno>
                  <idno type="idhal" notation="numeric">8188</idno>
                  <idno type="halauthorid" notation="string">2995821-8188</idno>
                  <idno type="IDREF">https://www.idref.fr/073272302</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7440-2980</idno>
                  <affiliation ref="#struct-389674"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">19594</idno>
                <idno type="issn">0304-3975</idno>
                <idno type="eissn">1879-2294</idno>
                <title level="j">Theoretical Computer Science</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">511</biblScope>
                  <biblScope unit="pp">13-22</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.tcs.2013.05.023</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</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>In this paper, we focus on the Sort &amp; Search method initially proposed by Horowitz and Sahni (1974) [6] to solve the knapsack problem, which has already show its applicability to derive exponential-time algorithms for some scheduling problems. We propose an extension of this method to a general class of problems called Multiple Constraint Problems and show that the extended Sort &amp; Search method enables one to derive new exponential-time algorithms, with O*(m(n/2)) worst-case complexity, for two scheduling problems.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-204893" status="VALID">
          <idno type="IdRef">081090722</idno>
          <idno type="RNSR">201220254T</idno>
          <idno type="ROR">https://ror.org/03r938j26</idno>
          <orgName>Laboratoire d'Informatique Fondamentale et Appliquée de Tours</orgName>
          <orgName type="acronym">LIFAT</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>64, Avenue Jean Portalis, 37200 Tours</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://lifat.univ-tours.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR6300" active="#struct-300298" type="direct"/>
            <relation active="#struct-303079" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1625" status="OLD">
          <idno type="IdRef">075434695</idno>
          <idno type="RNSR">200615274F</idno>
          <orgName>Laboratoire d'Informatique Fondamentale d'Orléans</orgName>
          <orgName type="acronym">LIFO</orgName>
          <date type="start">1987-01-01</date>
          <date type="end">2013-12-31</date>
          <desc>
            <address>
              <addrLine>Batiment IIIA 6 Rue Léonard de Vinci - BP 6759 45067 ORLEANS CEDEX 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/lifo/</ref>
          </desc>
          <listRelation>
            <relation name="EA4022" active="#struct-300297" type="direct"/>
            <relation name="EA4022" active="#struct-300379" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-389674" status="OLD">
          <orgName>Equipe Ordonnancement et Conduite</orgName>
          <orgName type="acronym">OC</orgName>
          <date type="start">2012-01-01</date>
          <date type="end">2017-12-12</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-204893" type="direct"/>
            <relation name="UR6300" active="#struct-300298" type="indirect"/>
            <relation active="#struct-303079" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300298" status="VALID">
          <idno type="IdRef">026404478</idno>
          <idno type="ISNI">0000000121608742</idno>
          <idno type="ROR">https://ror.org/02wwzvj46</idno>
          <orgName>Université de Tours</orgName>
          <orgName type="acronym">UT</orgName>
          <date type="start">1970-12-17</date>
          <desc>
            <address>
              <addrLine>60 rue du Plat d'Étain, 37020 Tours cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tours.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303079" status="VALID">
          <idno type="IdRef">203592077</idno>
          <orgName>Institut National des Sciences Appliquées - Centre Val de Loire</orgName>
          <orgName type="acronym">INSA CVL</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>88 boulevard Lahitolle, CS 60013, 18022 Bourges cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-centrevaldeloire.fr/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300297" status="VALID">
          <idno type="IdRef">026402971</idno>
          <idno type="ISNI">0000 0001 2158 1666</idno>
          <idno type="ROR">https://ror.org/014zrew76</idno>
          <orgName>Université d'Orléans</orgName>
          <orgName type="acronym">UO</orgName>
          <desc>
            <address>
              <addrLine>Château de la Source - Avenue du Parc Floral - BP 6749 - 45067 Orléans cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300379" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Ingénieurs de Bourges</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>