<?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%">Ricardo Saraiva de Camargo</style></author><author><style face="normal" font="default" size="100%">Gilberto de Miranda Júnior</style></author><author><style face="normal" font="default" size="100%">Morton E. O’Kelly</style></author><author><style face="normal" font="default" size="100%">James F. Campbell</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints</style></title><secondary-title><style face="normal" font="default" size="100%">Applied Mathematical Modelling</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/abs/pii/S0307904X17304274</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">51</style></volume><pages><style face="normal" font="default" size="100%">274-301</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;&lt;span style=&quot;background:#ffffff&quot;&gt;The incomplete hub location problem with and without hop-constraints is modeled using a &lt;/span&gt;&lt;i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;Leontief substitution system&lt;/span&gt;&lt;/i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt; approach. The &lt;/span&gt;&lt;i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt;Leontief&lt;/span&gt;&lt;/i&gt;&lt;span style=&quot;background:#ffffff&quot;&gt; formalism provides a set of important theoretical properties and delivers formulations with tight linear bounds that can explicitly incorporate hop constraints for each origin-destination pair of demands. Furthermore, the proposed formulations are amenable to a Benders decomposition technique which can solve large scale test instances. The performance of the devised algorithm is primarily due to a new general scheme for separating Benders feasibility cuts. The novel cuts render a stabilizing effect that is directly responsible for the solution of instances up to 80 nodes.&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record></records></xml>