<?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-04816859</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-02T06:25:41+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation</title>
            <author role="aut">
              <persName>
                <forename type="first">Jacques</forename>
                <surname>Carlier</surname>
              </persName>
              <email type="md5">77cc70eab656dd1c3ba4072a3583fbd8</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="numeric">852781</idno>
              <idno type="halauthorid" notation="string">187530-852781</idno>
              <affiliation ref="#struct-389870"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">François</forename>
                <surname>Clautiaux</surname>
              </persName>
              <email type="md5">044c1ed6f2a88906aa57459ef93a5ea2</email>
              <email type="domain">math.u-bordeaux.fr</email>
              <idno type="idhal" notation="string">clautiaux</idno>
              <idno type="idhal" notation="numeric">175194</idno>
              <idno type="halauthorid" notation="string">11381-175194</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9171-8012</idno>
              <idno type="IDREF">https://www.idref.fr/090207688</idno>
              <affiliation ref="#struct-389870"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Aziz</forename>
                <surname>Moukrim</surname>
              </persName>
              <email type="md5">a1e1fc0e8ce316c923d9357fe47f07cb</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">aziz-moukrim</idno>
              <idno type="idhal" notation="numeric">8097</idno>
              <idno type="halauthorid" notation="string">24681-8097</idno>
              <idno type="IDREF">https://www.idref.fr/075033372</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0151-6327</idno>
              <affiliation ref="#struct-389870"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>François</forename>
                <surname>Clautiaux</surname>
              </persName>
              <email type="md5">044c1ed6f2a88906aa57459ef93a5ea2</email>
              <email type="domain">math.u-bordeaux.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2024-12-03 15:44:38</date>
              <date type="whenModified">2025-06-24 10:16:03</date>
              <date type="whenReleased">2024-12-03 15:44:38</date>
              <date type="whenProduced">2007-08</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="148991">
                <persName>
                  <forename>François</forename>
                  <surname>Clautiaux</surname>
                </persName>
                <email type="md5">044c1ed6f2a88906aa57459ef93a5ea2</email>
                <email type="domain">math.u-bordeaux.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04816859</idno>
            <idno type="halUri">https://hal.science/hal-04816859</idno>
            <idno type="halBibtex">carlier:hal-04816859</idno>
            <idno type="halRefHtml">&lt;i&gt;Computers and Operations Research&lt;/i&gt;, 2007, 34 (8), pp.2223-2250. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.cor.2005.08.012"&gt;&amp;#x27E8;10.1016/j.cor.2005.08.012&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Computers and Operations Research, 2007, 34 (8), pp.2223-2250. &amp;#x27E8;10.1016/j.cor.2005.08.012&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </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="RO" corresp="HEUDIASYC">Réseaux, Optimisation</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="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">New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jacques</forename>
                    <surname>Carlier</surname>
                  </persName>
                  <email type="md5">77cc70eab656dd1c3ba4072a3583fbd8</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="numeric">852781</idno>
                  <idno type="halauthorid" notation="string">187530-852781</idno>
                  <affiliation ref="#struct-389870"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">François</forename>
                    <surname>Clautiaux</surname>
                  </persName>
                  <email type="md5">044c1ed6f2a88906aa57459ef93a5ea2</email>
                  <email type="domain">math.u-bordeaux.fr</email>
                  <idno type="idhal" notation="string">clautiaux</idno>
                  <idno type="idhal" notation="numeric">175194</idno>
                  <idno type="halauthorid" notation="string">11381-175194</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9171-8012</idno>
                  <idno type="IDREF">https://www.idref.fr/090207688</idno>
                  <affiliation ref="#struct-389870"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Aziz</forename>
                    <surname>Moukrim</surname>
                  </persName>
                  <email type="md5">a1e1fc0e8ce316c923d9357fe47f07cb</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">aziz-moukrim</idno>
                  <idno type="idhal" notation="numeric">8097</idno>
                  <idno type="halauthorid" notation="string">24681-8097</idno>
                  <idno type="IDREF">https://www.idref.fr/075033372</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0151-6327</idno>
                  <affiliation ref="#struct-389870"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12050</idno>
                <idno type="issn">0305-0548</idno>
                <idno type="eissn">1873-765X</idno>
                <title level="j">Computers and Operations Research</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">34</biblScope>
                  <biblScope unit="issue">8</biblScope>
                  <biblScope unit="pp">2223-2250</biblScope>
                  <date type="datePub">2007-08</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.cor.2005.08.012</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <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>The two-dimensional bin-packing problem (2BP) consists of minimizing the number of identical rectangles used to pack a set of smaller rectangles. In this paper, we propose new lower bounds for 2BP in the discrete case. They are based on the total area of the items after application of dual feasible functions (DFF). We also propose the new concept of data-dependent dual feasible functions (DDFF), which can also be applied to a 2BP instance. We propose two families of Discrete DFF and DDFF and show that they lead to bounds which strictly dominate those obtained previously. We also introduce two new reduction procedures and report computational experiments on our lower bounds. Our bounds improve on the previous best results and close 22 additional instances of a well-known established benchmark derived from literature.</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-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>