Newspaper Distribution Problem in a City Network.

Date of Submission

December 1997

Date of Award

Winter 12-12-1998

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Roy, Bimal Kumar (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

Suppose there are n no. of nodes(i.e junctions) in a city out of which there are m number of dumping nodes (m < n) where newspa- pers are to be supplied from the vehicle. The problem is to find the shortest route in terms of cost of edges where the starting node is the newspaper office itself & is required to traverse every dumping node at least once. ( this total cost does not include the cost of the edges from the last dumping nodes to the newspaper office).


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.