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

Belotti, Pietro; Soylu, Banu; Wiecek, Margaret M.

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Belotti, Pietro</dc:creator>
  <dc:creator>Soylu, Banu</dc:creator>
  <dc:creator>Wiecek, Margaret M.</dc:creator>
  <dc:date>2016-01-01</dc:date>
  <dc:description>We consider the class of biobjective mixed integer linear programs (BOMILPs). We review fathoming rules for general BOMILPs and present them in a unified manner. We then propose new fathoming rules that rely on solving specially designed LPs, hence making no assumption on the type of problem and only using polynomial-time algorithms. We describe an enhancement for carrying out these rules by performing a limited number of pivot operations on an LP, and then we provide insight that helps to make these rules even more efficient by either focusing on a smaller number of feasible solutions or by resorting to heuristics that limit the number of LPs solved. (C) 2016 Elsevier B.V. All rights reserved.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/58287</dc:identifier>
  <dc:identifier>oai:zenodo.org:58287</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>DISCRETE OPTIMIZATION 22 341-363</dc:source>
  <dc:title>Fathoming rules for biobjective mixed integer linear programs: Review and extensions</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>