Skip to main content

The Many-to-Many Location-Routing Problem

Nagy, Gábor, Salhi, Said (1998) The Many-to-Many Location-Routing Problem. TOP (Trabajos de Investigación Operativa), 6 (2). pp. 261-275. ISSN 1134-5764. (doi:10.1007/BF02564791) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:9932)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL
http://dx.doi.org/10.1007/BF02564791

Abstract

In this paper the many to many location routing problem is introduced, and its relationship to various problems in distribution management is emphasised. Useful mathematical formulations which can be easily extended to cater for other related problems are produced. Techniques for tackling this complex distribution problem are also outlined.

Item Type: Article
DOI/Identification number: 10.1007/BF02564791
Subjects: Q Science > Operations Research - Theory
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Gabor Nagy
Date Deposited: 24 Jun 2009 14:29 UTC
Last Modified: 16 Nov 2021 09:48 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/9932 (The current URI for this page, for reference purposes)
Nagy, Gábor: https://orcid.org/0000-0002-7609-5718
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):