Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

DOI10.1287/mnsc.23.8.789zbMath0361.90034OpenAlexW1973315504WikidataQ56814663 ScholiaQ56814663MaRDI QIDQ4135210

Nemhauser, George I., Marshall L. Fisher, Cornuéjols, Gérard

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.8.789

Mathematics Subject Classification ID

Applications of statistics to actuarial sciences and financial mathematics (62P05) Applications of mathematical programming (90C90) Operations research and management science (90B99)

Related Items

Influence maximization problem: properties and algorithms, Application of the facility location problem to the problem of locating concentrators on an FAA microwave system, A heuristic for large-size \(p\)-median location problems with application to school location, Making a state-of-the-art heuristic faster with data mining, Multi-level facility location as the maximization of a submodular set function, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, Local search heuristics for the mobile facility location problem, A heuristic method for the multi-story layout problem, An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, The \(p\)-median problem: a survey of metaheuristic approaches, Algorithms for central-median paths with bounded length on trees, Optimal product design using conjoint analysis: Computational complexity and algorithms, Strategic design of distribution systems with economies of scale in transportation, Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs, Computational study of large-scale \(p\)-median problems, Solving the anti-covering location problem using Lagrangian relaxation, A model for the capacitated \(p\)-facility location problem in global environments, Pick-and-choose heuristics for partial set covering, A Lagrangian search method for the \(P\)-median problem, Multiple facility location on a network with linear reliability order of edges, A double annealing algorithm for discrete location/allocation problems, The capacitated plant location problem, Fast approximate energy minimization with label costs, Developments in network location with mobile and congested facilities, A comparative study of approaches to dynamic location problems, A cost operator approach to multistage location-allocation, A graph theoretical bound for the p-median problem, Reducibility of minimax to minisum 0-1 programming problems, Domination analysis of combinatorial optimization problems., An upper bound on the number of execution nodes for a distributed join, On the linear relaxation of the \(p\)-median problem, Simultaneous selection, Budget constrained location problem with opening and closing of facilities., A Lagrangean dual ascent algorithm for simple plant location problems, A tree search algorithm for the p-median problem, A projection method for the uncapacitated facility location problem, A method for solving to optimality uncapacitated location problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Stochastic block-coordinate gradient projection algorithms for submodular maximization, Surrogate duality relaxation for job shop scheduling, Locational analysis, Fast primal and dual heuristics for the \(p\)-median location problem, A new warmstarting strategy for the primal-dual column generation method, Lagrangian relaxations for multiple network alignment, Optimal partitioning of a data set based on the \(p\)-median model, A two-stage stochastic programming approach for influence maximization in social networks, On the \(p\)-median polytope of \(Y\)-free graphs, On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs, New performance guarantees for the greedy maximization of submodular set functions, An approximation algorithm for a competitive facility location problem with network effects, Survivable networks, linear programming relaxations and the parsimonious property, The multicovering problem, Hooked on IP, IP over 40+ years at IBM scientific centers and marketing, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), Facility location models for distribution system design, Performance bounds with curvature for batched greedy optimization, Phylogenetic diversity and the maximum coverage problem, Valid inequalities and facets of the capacitated plant location problem, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, Meaningfulness of conclusions from combinatorial optimization, Scheduling crackdowns on illicit drug markets, Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada, Competitive location on networks under delivered pricing, Approximability of minimum AND-circuits, Aggregation error for location models: Survey and analysis, A computational evaluation of a general branch-and-price framework for capacitated network location problems, An efficient tabu search procedure for the \(p\)-median problem, Heuristic concentration: Two stage solution construction, Exemplar-based clustering via simulated annealing, Plant location with minimum inventory, 2-medians in trees with pos/neg weights, An 0. 828-approximation algorithm for the uncapacitated facility location problem, Network production-location problems under price uncertainty, Recent trends in combinatorial optimization, Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem, Heuristics for the capacitated plant location model, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, Using a facility location algorithm to solve large set covering problems, A heuristic lagrangean algorithm for the capacitated plant location problem, A comparison of two dual-based procedures for solving the p-median problem, A tree search algorithm for the multi-commodity location problem, Some remarks about the `equivalence' of performance measures in scheduling problems, ASEAN industrial cooperation: The case of multi-product capacity expansion, Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors, Analyzing tradeoffs between zonal constraints and accessibility in facility location, Integer programming formulations of discrete hub location problems, An approximation algorithm for the maximization version of the two level uncapacitated facility location problem, An extension of the \(p\)-median group technology algorithm, Modelling a fertiliser distribution system, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, 'Multidimensional' extensions and a nested dual approach for the m-median problem, A two-phase tabu search approach to the location routing problem, An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints, Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid, Siting renewable power generation assets with combinatorial optimisation, Worst-Case Analysis of Network Design Problem Heuristics, A Canonical Representation of Simple Plant Location Problems and Its Applications, Tight Approximation Bounds for Maximum Multi-coverage, A maximal covering location model in the presence of partial coverage, A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION, Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs, STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, Heuristics for the multi-resource generalized assignment problem, A Branch-and-Cut Algorithm for Submodular Interdiction Games, On dependent randomized rounding algorithms, Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --, The minimum weighted covering location problem with distance constraints, Analysis of a local search algorithm for the k-facility location problem, Locating flow-intercepting facilities: New approaches and results, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems, Hub Location as the Minimization of a Supermodular Set Function, Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7, Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization, Recognizing Coverage Functions, Approximate separable multichoice optimization over monotone systems, Joint chance constrained shortest path problem with Copula theory, Discrete facility location in machine learning, Misinformation influence minimization problem based on group disbanded in social networks, A note on the implications of approximate submodularity in discrete optimization, Configuration‐based approach for topological problems in the design of wireless sensor networks, Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems, Constrained Submodular Maximization via a Nonsymmetric Technique, Influence maximization with deactivation in social networks, Submodular optimization problems and greedy strategies: a survey, Nash welfare guarantees for fair and efficient coverage, IM2Vec: representation learning-based preference maximization in geo-social networks, A 6/5-approximation algorithm for the maximum 3-cover problem, A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function, Location of slaughterhouses under economies of scale, PASS approximation: a framework for analyzing and designing heuristics, On the Location and p-Median Polytopes, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, Inequalities on submodular functions via term rewriting, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, The maximum vertex coverage problem on bipartite graphs, GASUB: finding global optima to discrete location problems by a genetic-like algorithm, The Complexity of Partial Function Extension for Coverage Functions, The approximation gap for the metric facility location problem is not yet closed, A dual ascent approach for steiner tree problems on a directed graph, Stochastic facility location with general long-run costs and convex short-run costs, Multi-level facility location problems, Quadratic convex reformulation for quadratic programming with linear on-off constraints, A fast swap-based local search procedure for location problems, Solving a bi-objective transportation location routing problem by metaheuristic algorithms, Product line selection and pricing analysis: impact of genetic relaxations, The multi-level uncapacitated facility location problem is not submodular, Solving the uncapacitated facility location problem using tabu search, A simple filter-and-fan approach to the facility location problem, Approximating the two-level facility location problem via a quasi-greedy approach, A family of facets for the uncapacitated \(p\)-median polytope, An analysis of approximations for maximizing submodular set functions—I, An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function., On a connection between facility location and perfect graphs, An improved Lagrangian relaxation and dual ascent approach to facility location problems, The generalized maximal covering location problem, Affinity propagation and uncapacitated facility location problems, Search complexity: a way for the quantitative analysis of the search space, Lagrangean heuristics for location problems, The plant location problem with demand-dependent setup costs and centralized allocation, A gamma heuristic for the \(p\)-median problem, Optimal sensor placement for underwater threat detection, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM, Online Submodular Maximization with Preemption, NP-Complete operations research problems and approximation algorithms, Differential approximation of NP-hard problems with equal size feasible solutions, Efficient computation of 2-medians in a tree network with positive/negative weights, A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints, Assessment of approximate algorithms: The error measure's crucial role, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, Modeling and Optimization of a Spatial Detection System, Heuristic methods and applications: A categorized survey, The multi-level uncapacitated facility location problem is not submodular, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, The simple plant location problem: Survey and synthesis, Heuristics for the fixed cost median problem, Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs, Uncapacitated and Capacitated Facility Location Problems, Exact Solution of Two Location Problems via Branch-and-Bound, COLE: a new heuristic approach for fixed charge problem computational results, On approximation of max-vertex-cover, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, On the Greedy Heuristic for Continuous Covering and Packing Problems, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, A Probabilistic Analysis of the K-Location Problem, A note on the maximization version of the multi-level facility location problem, A Primal Approach to the Simple Plant Location Problem, Optimal intervention in economic networks using influence maximization methods, Tight approximation bounds for maximum multi-coverage, Stochastic makespan minimization in structured set systems