APPROXIMATE ALGORITHM FOR THE FIXED CHARGE CAPACITATED SITE LOCATION PROBLEM.
Abstract
An approximate algorithm for the fixed charge, capacitated site location problem is presented. Numerical examples are used to justify the reasonableness of certain steps of the algorithm. The suboptimal algorithm is shown to result in the optimal solution under certain conditions. The algorithm also establishes bounds that can be used to reduce significantly the number of combinations that need to be examined in any partial enumeration algorithm for determining the exact solution. The algorithm can also be used to determine investments time-phased over several periods. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1967
- Accession Number
- AD0653787
Entities
People
- Geza Jandy
Organizations
- Stanford University