Location on Networks
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Business and Economics > Business and Management > Management and management techniques > Management decision making > Location on Networks: Theory and Algorithms
Location on Networks: Theory and Algorithms

Location on Networks: Theory and Algorithms


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Many kinds of organizations--large and small, public and private--are faced with decisions on where to locate their facilities so that they can provide optimal utility both to those who benefit from them and to the organization itself. What are the best available sites for locating--to give just a few examples--a system of fire stations, health outreach clinics, parking garages, shopping malls, radar stations, computer centers, elementary schools, police patrol cars, switching centers, warehouses? The (spatial) location of such facilities usually takes place in the context of a given transportation, communication, or transmission system, that for analytic purposes may be represented as a network of nodes (population centers, terminals, manufacturing sites) and links (highways, railways, telephone cables) connecting pairs of nodes.This study is concerned with the analytical aspects of facility location in systems where such an underlying network structure exists. While numerous texts have been published both on network analysis and on location theory (based on Euclidean or rectangular measures, as distinct from network distance measures defined in terms of such variables as maximum response time), this text is the first book-length treatment of the intersection of the two topics. The book serves both to summarize the present range of this approach and to advance it measurably.The authors write that "The orientation of this book is toward algorithmic solutions to network location problems [which are] often formulated as discrete optimization problems. While our primary concern is with practical optimum-seeking methods, we also discuss some heuristic approaches as well as results concerning upper bounds on the computational complexity of these problems...."The prerequisites for this text would be satisfied by an introductory course in operations research with primary emphasis on optimization techniques including linear programming and complex analysis. Prior knowledge of network analysis (graph theory) is useful though not essential. (An appendix is devoted to a brief introduction to the relevant concepts of graph theory.) A basic understanding of probability theory is also needed for some of the material. We have tried to keep the level of mathematics to a minimum beyond these prerequisites. We hope that the text will be of interest to transportation systems analysts, urban and regional planners, industrial, communication, and systems engineers, and academicians and professionals in management, geography, engineering, operations research, and applied mathematics."This book is the first in the MIT Press Series in Signal Processing, Optimization, and Control, edited by Alan S. Willsky.


Best Sellers


Product Details
  • ISBN-13: 9780262080903
  • Publisher: MIT Press Ltd
  • Publisher Imprint: MIT Press
  • Height: 229 mm
  • Spine Width: 25 mm
  • Weight: 454 gr
  • ISBN-10: 0262080907
  • Publisher Date: 31 Mar 1979
  • Binding: Hardback
  • Language: English
  • Sub Title: Theory and Algorithms
  • Width: 152 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Location on Networks: Theory and Algorithms
MIT Press Ltd -
Location on Networks: Theory and Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Location on Networks: Theory and Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!