https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Bertazzi_et_al_2013aBertazzi et al 2013a - Revision history2026-04-26T05:55:45ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Bertazzi_et_al_2013a&diff=175975&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 651419359 to Bertazzi et al 2013a2020-10-14T14:20:07Z<p>Scipediacontent moved page <a href="/public/Draft_Content_651419359" class="mw-redirect" title="Draft Content 651419359">Draft Content 651419359</a> to <a href="/public/Bertazzi_et_al_2013a" title="Bertazzi et al 2013a">Bertazzi et al 2013a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 14:20, 14 October 2020</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Bertazzi_et_al_2013a&diff=175974&oldid=prevScipediacontent: Created page with " == Abstract == In this paper we consider the problem of shipping several products from an origin to a destination, when a discrete set of shipping frequencies is available o..."2020-10-14T14:20:04Z<p>Created page with " == Abstract == In this paper we consider the problem of shipping several products from an origin to a destination, when a discrete set of shipping frequencies is available o..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
In this paper we consider the problem of shipping several products from an origin to a destination, when a discrete set of shipping frequencies is available only, in such a way that the sum of the transportation and inventory cost is minimized This problem, which is known to be NP-hard, has applications in transportation planning and in location analysis. We derive some dominance rules for the problem solutions which allow to tighten the bounds on the problem variables. Moreover, we present a branch-and-bound algorithm and we evaluate its performance on randomly generated problem instances.<br />
<br />
Document type: Part of book or chapter of book<br />
<br />
== Full document ==<br />
<pdf>Media:Draft_Content_651419359-beopen986-2346-document.pdf</pdf><br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://link.springer.com/content/pdf/10.1007%2F978-0-387-34897-1_65.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-34897-1_65.pdf]</div>Scipediacontent