Multiple Postmen Problems- Fundamentals and New Algorithms (Paperback)

The effective management of transportation resources can reduce the expenses of an organization significantly. For these reasons the study of routing problems has been an important area of operations research for the last fifty years, and its significance is still growing with the increasing numbers of companies and organizations that have to deal with transport activities. This book deals with a major subclass of routing problems, so called postman problems, where services have to be performed along streets, e.g., postal service, waste collection or street cleaning activities. The introductory part of the book gives a comprehensive survey to routing problems. The main part of the book is dedicated to an in-depth treatment of postman problems with multiple postmen. The author presents fundamental and well known methods as well as new algorithms to attack these problems effectively. This book is valuable for mathematicians, computer scientists and economists who have to solve multiple postmen problems in theory and practice.

General

Imprint:	VDM Verlag Dr. Mueller E.K.
Country of origin:	Germany
Release date:	November 2007
First published:	November 2007
Authors:	Dino Ahr
Dimensions:	244 x 170 x 12mm (L x W x T)
Format:	Paperback - Trade
Pages:	220
ISBN-13:	978-3-8364-4496-5
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General
LSN:	3-8364-4496-8
Barcode:	9783836444965

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!