Dergi makalesi Açık Erişim
Belotti, Pietro; Soylu, Banu; Wiecek, Margaret M.
<?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">Fathoming rules for biobjective mixed integer linear programs: Review and extensions</subfield> </datafield> <datafield tag="909" ind1="C" ind2="4"> <subfield code="p">DISCRETE OPTIMIZATION</subfield> <subfield code="v">22</subfield> <subfield code="c">341-363</subfield> </datafield> <controlfield tag="001">58287</controlfield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield> </datafield> <datafield tag="520" ind1=" " ind2=" "> <subfield code="a">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.</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">Erciyes Univ, Dept Ind Engn, TR-38039 Kayseri, Turkey</subfield> <subfield code="a">Soylu, Banu</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Clemson Univ, Dept Math Sci, Clemson, SC 29630 USA</subfield> <subfield code="a">Wiecek, Margaret M.</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">FICO, Xpress Optimizer Team, Birmingham B37 7GN, W Midlands, England</subfield> <subfield code="a">Belotti, Pietro</subfield> </datafield> <datafield tag="260" ind1=" " ind2=" "> <subfield code="c">2016-01-01</subfield> </datafield> <controlfield tag="005">20210316002928.0</controlfield> <datafield tag="909" ind1="C" ind2="O"> <subfield code="o">oai:zenodo.org:58287</subfield> <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield> </datafield> <datafield tag="856" ind1="4" ind2=" "> <subfield code="z">md5:c464c6c33c881a7fbe1cffd47025d093</subfield> <subfield code="s">171</subfield> <subfield code="u">https://aperta.ulakbim.gov.trrecord/58287/files/bib-7665584b-2309-4a5e-b896-8abde280ee9c.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.disopt.2016.09.003</subfield> <subfield code="2">doi</subfield> </datafield> </record>
Görüntülenme | 40 |
İndirme | 7 |
Veri hacmi | 1.2 kB |
Tekil görüntülenme | 38 |
Tekil indirme | 7 |