<?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-01150601</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-19T08:06:49+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Scheme for Exact Separation of Extended Cover Inequalities and Application to Multidimensional Knapsack Problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Virginie</forename>
                <surname>Gabrel</surname>
              </persName>
              <idno type="halauthorid">181051-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Michel</forename>
                <surname>Minoux</surname>
              </persName>
              <email type="md5">23784359b19345768a10a50e0eeac2cd</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">846863</idno>
              <idno type="halauthorid" notation="string">235504-846863</idno>
              <idno type="IDREF">https://www.idref.fr/027031241</idno>
              <affiliation ref="#struct-408312"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lip6</forename>
                <surname>Publications</surname>
              </persName>
              <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-05-11 15:32:51</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2015-05-11 15:32:51</date>
              <date type="whenProduced">2002-08</date>
              <ref type="externalLink" target="https://api.istex.fr/ark:/67375/6H6-JRJD54N0-6/fulltext.pdf?sid=hal"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="196566">
                <persName>
                  <forename>Lip6</forename>
                  <surname>Publications</surname>
                </persName>
                <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01150601</idno>
            <idno type="halUri">https://hal.science/hal-01150601</idno>
            <idno type="halBibtex">gabrel:hal-01150601</idno>
            <idno type="halRefHtml">&lt;i&gt;Operations Research Letters&lt;/i&gt;, 2002, 30 (4), pp.252-264. &lt;a target="_blank" href="https://dx.doi.org/10.1016/S0167-6377(02)00124-4"&gt;&amp;#x27E8;10.1016/S0167-6377(02)00124-4&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Operations Research Letters, 2002, 30 (4), pp.252-264. &amp;#x27E8;10.1016/S0167-6377(02)00124-4&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</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 Scheme for Exact Separation of Extended Cover Inequalities and Application to Multidimensional Knapsack Problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Virginie</forename>
                    <surname>Gabrel</surname>
                  </persName>
                  <idno type="halauthorid">181051-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Michel</forename>
                    <surname>Minoux</surname>
                  </persName>
                  <email type="md5">23784359b19345768a10a50e0eeac2cd</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">846863</idno>
                  <idno type="halauthorid" notation="string">235504-846863</idno>
                  <idno type="IDREF">https://www.idref.fr/027031241</idno>
                  <affiliation ref="#struct-408312"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">17629</idno>
                <idno type="issn">0167-6377</idno>
                <idno type="eissn">1872-7468</idno>
                <title level="j">Operations Research Letters</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">30</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">252-264</biblScope>
                  <date type="datePub">2002-08</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/S0167-6377(02)00124-4</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>We present an exact separation scheme for identifying most violated extended cover inequalities for application to multidimensional knapsack problems (MKP). The minimality of the resulting covers is shown to be a basic property of the criterion used for separation, namely the ratio between left- and right-hand sides of the extended cover inequality looked for. Computational results obtained on a set of randomly generated (MKP) instances together with instances from the OR-library with up to 180 variables and 60 constraints show significant reduction in overall computing times as compared with the standard version of Cplex 6.5 in MIP mode using automatic cover inequality generation.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-408312" status="OLD">
          <orgName>Algorithmique numérique et parallélisme</orgName>
          <orgName type="acronym">ANP</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2003-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.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>