(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...") |
m (Scipediacontent moved page Draft Content 651419359 to Bertazzi et al 2013a) |
(No difference)
|
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.
Document type: Part of book or chapter of book
The different versions of the original document can be found in:
Published on 01/01/2013
Volume 2013, 2013
DOI: 10.1007/978-0-387-34897-1_65
Licence: CC BY-NC-SA license
Are you one of the authors of this document?