Exceptional Paper--Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
AbstractThe number of days required to clear a check drawn on a bank in city j depends on the city i in which the check is cashed. Thus, to maximize its available funds, a company that pays bills to numerous clients in various locations may find it advantageous to maintain accounts in several strategically located banks. We will discuss the problem of optimally locating bank accounts to maximize clearing times. The importance of this problem depends in part on its mathematical equivalence to the well-known uncapacitated plant location problem. We present a Lagrangian dual for obtaining an upper bound and heuristics for obtaining a lower bound on the value of an optimal solution. Our main results are analytical worst-case analyses of these bounds. In particular we show that the relative error of the dual bound and a "greedy" heuristic never exceeds [(K - 1)/K] k
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 23 (1977)
Issue (Month): 8 (April)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Naik, Ashich V. & Baveja, Alok & Batta, Rajan & Caulkins, Jonathan P., 1996. "Scheduling crackdowns on illicit drug markets," European Journal of Operational Research, Elsevier, vol. 88(2), pages 231-250, January.
- Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
- Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
- Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
- Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
- Li, Xiaopeng & Ouyang, Yanfeng, 2011. "Reliable sensor deployment for network traffic surveillance," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 218-231, January.
- Righini, Giovanni, 1995. "A double annealing algorithm for discrete location/allocation problems," European Journal of Operational Research, Elsevier, vol. 86(3), pages 452-468, November.
- Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
- Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.