HOME    Awards      Book    Courses      Education    Employment    Grants    Pictures       Publications    Service    Software      Students

Mark S. Daskin -- My Book

Network and Discrete Location:  Models Algorithms and Applications

Book cover 

Click here to download the new software for the book.  And here for a link to AMAZON.COM to buy it.

Daskin, M. S., 1995, Network and Discrete Location: Models, Algorithms and Applications, John Wiley and Sons, Inc., New York.

Table of Contents:

  1. Introduction to Location Theory and Models
    1.1	Introduction
    1.2	Key Questions Addressed by Location Models
    1.3	Example Problem Descriptions
    1.4	A Taxonomy of Location Problems and Models
    1.5	Summary
    	Exercises
  2. Review of Linear Programming Problem
    2.1	Introduction
    2.2	The Canonical Form of a Linear Programming Problem
    2.3	Constructing the Dual of an LP Problem
    2.4	Complementary Slackness and the Relationships Between
    	the Primal and Dual Linear Programming Problems
    2.5	The Transportation Problem
    2.6	The Shortest Path Problem
    2.7	The Out-Of-Kilter Flow Algorithm
    2.8	Summary
    	Exercises
  3. An overview of Complexity Analysis
    3.1	Introduction
    3.2	Basic Concepts and Notation
    3.3	Example Computation of an Algorithm's Complexity
    3.4	The Classes P and NP (and NP-hard and NP-complete)
    3.5	Summary
    	Exercises
  4. Covering Problems
    4.1	Introduction and the Notion of Coverage
    4.2	The Set Covering Model
    4.3	Applications of the Set Covering Model
    4.4	Variants of the Set Covering Location Model
    4.5	The Maximum Covering Location Model
    4.6	The Maximum Expected Covering Location Model
    4.7	Summary
    	Exercises
  5. Center Problems
    5.1	Introduction
    5.2	Vertex P-Center Formulation
    5.3	The Absolute 1- and 2-Center Problems on a Tree
    5.4	The Unweighted Vertex P-Center Problem on a General Graph
    5.5	The Unweighted Absolute P-Center Problem on a General Graph
    5.6	Summary
    	Exercises
  6. Median Problems
    6.1	Introduction
    6.2	Formulation and Properties
    6.3	1-Median Problem on a Tree
    6.4	Heuristic Algorithms for the P-Median Problem
    6.5	An Optimization-Based Lagrangian Algorithm for the
    	P-Median Problem
    6.6	Computational Results Using the Heuristic Algorithms
    	and the Lagrangian Relaxation Algorithm
    6.7	Summary
    	Exercises
  7. Fixed Charge Facility Location Problems
    7.1	Introduction
    7.2	Uncapacitated Fixed Charge Facility Location Problems
    7.3	Capacitated Fixed Charge Facility Location Problems
    7.4	Summary
    	Exercises
  8. Extensions of Location Problems
    8.1	Introduction
    8.2	Multiobjective Problems
    8.3	Hierarchical Facility Location Problems
    8.4	Models of Interacting Facilities
    8.5	Multiproduct Flows and Production/Distribution Systems
    8.6	Location/Routing Problems
    8.7	Hub Location Problems
    8.8	Dispersion Models and Models for 
    	the Location of Undesirable Facilities
    8.9	Summary
    	Exercises
  9. Location Modeling in Perspective
    9.1	Introduction
    9.2	The Planning Process for Facility Location
    9.3	Summary
    	Exercises
    10.