1 Ocak 2022 Dergi makalesi Açık Erişim

Dogan, Ilgin; Lokman, Banu; Koksalan, Murat

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Representing the nondominated set in multi-objective mixed-integer programs</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">EUROPEAN JOURNAL OF OPERATIONAL RESEARCH</subfield>
    <subfield code="v">296</subfield>
    <subfield code="n">3</subfield>
    <subfield code="c">804-818</subfield>
  </datafield>
  <controlfield tag="001">236946</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">A B S T R A C T In this paper, we consider generating a representative subset of nondominated points at a prespecified precision in multi-objective mixed-integer programs (MOMIPs). The number of nondominated points grows exponentially with problem size and finding all nondominated points is typically hard in MOMIPs. Representing the nondominated set with a small subset of nondominated points is important for a decision maker to get an understanding of the layout of solutions. The shape and density of the nondominated points over the objective space may be critical in obtaining a set of solutions that represent the nondominated set well. We develop an exact algorithm that generates a representative set guaranteeing a prespecified precision. Our experiments on a variety of problems demonstrate that our algorithm outperforms existing approaches in terms of both the cardinality of the representative set and computation times. (c) 2021 Elsevier B.V. All rights reserved.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Univ Portsmouth, Portsmouth Business Sch, Ctr Operat Res &amp; Logist, Portsmouth PO1 3DE, Hants, England</subfield>
    <subfield code="a">Lokman, Banu</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Koksalan, Murat</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Univ Calif Berkeley, Dept Ind Engn &amp; Operat Res, Berkeley, CA 94720 USA</subfield>
    <subfield code="a">Dogan, Ilgin</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2022-01-01</subfield>
  </datafield>
  <controlfield tag="005">20221007094738.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:aperta.ulakbim.gov.tr:236946</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:0b4c6bcf8d0a8228ddc3de4830642b89</subfield>
    <subfield code="s">180</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/236946/files/bib-236acb8c-bdb0-4a56-a51b-1c4585e7adae.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1016/j.ejor.2021.04.005</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>