The DOI matches its Crossref record.
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Abstract
The 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 < 1/e for a problem in which at most K locations are to be chosen. Two other heuristics are shown to have worst-case relative errors of at least (k − 1)/(2K − 1) < 1/2. Examples are given showing that all these bounds can be achieved. We present extensive computational results for these approximations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Self-citationVital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Facility location under uncertainty: a review
Snyder, L. V. (2006) · IIE Transactions · doi:10.1080/07408170500216480 · Cited by 1,019
Facility location models for distribution system design
Klose, A., & Drexl, A. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2003.10.031 · Cited by 965
Influential Nodes in a Diffusion Model for Social Networks
Kempe, D., Kleinberg, J., & Tardos, É. (2005) · Lecture Notes in Computer Science · doi:10.1007/11523468_91 · Cited by 948
Integer programming formulations of discrete hub location problems
Campbell, J. F. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90318-2 · Cited by 916
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Limiting the spread of misinformation in social networks
Budak, C., Agrawal, D., & El Abbadi, A. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963499 · Cited by 807
On the placement of Web server replicas
Qiu, L., Padmanabhan, V. N., & Voelker, G. M. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916655 · Cited by 798
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Calinescu, G., Chekuri, C., Pál, M., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/080733991 · Cited by 795
An analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
Self-citationThe simple plant location problem: Survey and synthesis
Krarup, J., & Pruzan, P. M. (1983) · European Journal of Operational Research · doi:10.1016/0377-2217(83)90181-9 · Cited by 544
Best Algorithms for Approximating the Maximum of a Submodular Set Function
Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematics of Operations Research · doi:10.1287/moor.3.3.177 · Cited by 538
Self-citationReserve selection as a maximal covering location problem
Church, R. L., Stoms, D. M., & Davis, F. W. (1996) · Biological Conservation · doi:10.1016/0006-3207(95)00102-6 · Cited by 475
Maximizing Non-monotone Submodular Functions
Feige, U., Mirrokni, V. S., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/090779346 · Cited by 452
The p-median problem: A survey of metaheuristic approaches
Mladenović, N., Brimberg, J., Hansen, P., & Moreno-Pérez, J. A. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.05.034 · Cited by 433
Fast approximate energy minimization with label costs
Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539897 · Cited by 404
Fast Approximate Energy Minimization with Label Costs
Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0437-z · Cited by 381
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
Ageev, A. A., & Sviridenko, M. I. (2004) · Journal of Combinatorial Optimization · doi:10.1023/b:joco.0000038913.96607.c2 · Cited by 363
Optimization Methods in Finance
Cornuejols, G., & Tütüncü, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753886 · Cited by 347
Self-citationScene Summarization for Online Image Collections
Simon, I., Snavely, N., & Seitz, S. M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408863 · Cited by 339
Variable Neighborhood Decomposition Search
Hansen, P., Mladenović, N., & Perez-Britos, D. (2001) · Journal of Heuristics · doi:10.1023/a:1011336210885 · Cited by 296
A simulated annealing heuristic for the capacitated location routing problem
Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.10.007 · Cited by 287
Selection of views to materialize in a data warehouse
Gupta, H., & Mumick, I. S. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.16 · Cited by 280
Metadata
- Authors
- Cornuejols, G., Fisher, M. L., & Nemhauser, G. L.
- Venue
- Management Science
- Published
- 1977-04
- Volume
- 23
- Issue
- 8
- Pages
- 789-810
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W1973315504
- Cited by
- 793
- References
- 0
- FWCI
- 23.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.