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 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

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

Back to Top

Document information

Published on 01/01/2013

Volume 2013, 2013
DOI: 10.1007/978-0-387-34897-1_65
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?