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

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

Cited In (only showing first 100 items - show all)

A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
Hooked on IP
IP over 40+ years at IBM scientific centers and marketing
Influence maximization problem: properties and algorithms
Survivable networks, linear programming relaxations and the parsimonious property
On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
Optimal partitioning of a data set based on the \(p\)-median model
Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors
The multi-level uncapacitated facility location problem is not submodular
Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
A tree search algorithm for the p-median problem
A gamma heuristic for the \(p\)-median problem
Algorithms for central-median paths with bounded length on trees
Heuristic methods and applications: A categorized survey
Tight approximation bounds for maximum multi-coverage
Tight approximation bounds for maximum multi-coverage
Heuristic concentration: Two stage solution construction
Performance bounds with curvature for batched greedy optimization
A note on the implications of approximate submodularity in discrete optimization
Locating flow-intercepting facilities: New approaches and results
Fast primal and dual heuristics for the \(p\)-median location problem
On the location and \(p\)-median polytopes
Phylogenetic diversity and the maximum coverage problem
Developments in network location with mobile and congested facilities
Inequalities on submodular functions via term rewriting
An upper bound on the number of execution nodes for a distributed join
The plant location problem with demand-dependent setup costs and centralized allocation
A cost operator approach to multistage location-allocation
On dependent randomized rounding algorithms
NP-Complete operations research problems and approximation algorithms
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
A heuristic method for the multi-story layout problem
Simultaneous selection
A 6/5-approximation algorithm for the maximum 3-cover problem
Network production-location problems under price uncertainty
A tree search algorithm for the multi-commodity location problem
Pick-and-choose heuristics for partial set covering
An extension of the \(p\)-median group technology algorithm
Using a facility location algorithm to solve large set covering problems
ASEAN industrial cooperation: The case of multi-product capacity expansion
An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
Optimal sensor placement for underwater threat detection
Differential approximation of NP-hard problems with equal size feasible solutions
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
A Primal Approach to the Simple Plant Location Problem
Modelling a fertiliser distribution system
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
New performance guarantees for the greedy maximization of submodular set functions
A simple filter-and-fan approach to the facility location problem
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
Stochastic facility location with general long-run costs and convex short-run costs
COLE: a new heuristic approach for fixed charge problem computational results
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
A new warmstarting strategy for the primal-dual column generation method
Efficient computation of 2-medians in a tree network with positive/negative weights
Heuristics for the fixed cost median problem
A Canonical Representation of Simple Plant Location Problems and Its Applications
Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
A dual ascent approach for steiner tree problems on a directed graph
Facility location models for distribution system design
The \(p\)-median problem: a survey of metaheuristic approaches
Heuristics for the capacitated plant location model
On the linear relaxation of the \(p\)-median problem
On approximation of max-vertex-cover
Worst-Case Analysis of Network Design Problem Heuristics
An efficient tabu search procedure for the \(p\)-median problem
2-medians in trees with pos/neg weights
Integer programming formulations of discrete hub location problems
An 0. 828-approximation algorithm for the uncapacitated facility location problem
Exemplar-based clustering via simulated annealing
A family of facets for the uncapacitated \(p\)-median polytope
A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
On the \(p\)-median polytope of \(Y\)-free graphs
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
Lagrangean heuristics for location problems
Computational study of large-scale \(p\)-median problems
A Lagrangean dual ascent algorithm for simple plant location problems
A two-phase tabu search approach to the location routing problem
Uncapacitated and capacitated facility location problems
The generalized maximal covering location problem
Heuristics for the multi-resource generalized assignment problem
A Lagrangian search method for the \(P\)-median problem
Multi-level facility location as the maximization of a submodular set function
Strategic design of distribution systems with economies of scale in transportation
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
Optimal product design using conjoint analysis: Computational complexity and algorithms
Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
Fast approximate energy minimization with label costs
Approximability of minimum AND-circuits
A maximal covering location model in the presence of partial coverage
The multi-level uncapacitated facility location problem is not submodular
Meaningfulness of conclusions from combinatorial optimization
A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
The maximum vertex coverage problem on bipartite graphs
Reducibility of minimax to minisum 0-1 programming problems
A fast swap-based local search procedure for location problems

This page was built for publication: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4135210)