<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Ivan Contreras</style></author><author><style face="normal" font="default" size="100%">Ricardo Saraiva de Camargo</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A comparison of separation routines for benders optimality cuts for two-level facility location problems</style></title><secondary-title><style face="normal" font="default" size="100%">Expert Systems with Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0957417419306463</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">141</style></volume><pages><style face="normal" font="default" size="100%">112928</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;western&quot; style=&quot;margin-bottom:0.28cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;This paper studies two-level uncapacitated facility location problems, a class of discrete location problems that consider different hierarchies of facilities and their interactions. Benders reformulations for both single and multiple assignment variants and while several separation procedures for three classes of Benders cuts are presented: standard optimality cuts, lifted optimality cuts, and non-dominated optimality cuts. Extensive computational experiments are performed on difficult and large-scale benchmark instances to assess the performance of the considered separation routines.&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record></records></xml>