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 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
Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem
Solving the uncapacitated facility location problem using tabu search
Approximating the two-level facility location problem via a quasi-greedy approach
\(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
Local search heuristics for the mobile facility location problem
Analysis of relaxations for the multi-item capacitated lot-sizing problem
Valid inequalities and facets of the capacitated plant location problem
Surrogate duality relaxation for job shop scheduling
Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
Aggregation error for location models: Survey and analysis
Solving the anti-covering location problem using Lagrangian relaxation
Competitive location on networks under delivered pricing
A heuristic lagrangean algorithm for the capacitated plant location problem
A comparative study of approaches to dynamic location problems
Locational analysis
The simple plant location problem: Survey and synthesis
On the Greedy Heuristic for Continuous Covering and Packing Problems
A computational evaluation of a general branch-and-price framework for capacitated network location problems
A heuristic for large-size \(p\)-median location problems with application to school location
A comparison of two dual-based procedures for solving the p-median problem
'Multidimensional' extensions and a nested dual approach for the m-median problem
Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
Budget constrained location problem with opening and closing of facilities.
A graph theoretical bound for the p-median problem
Solving a bi-objective transportation location routing problem by metaheuristic algorithms
Hub location as the minimization of a supermodular set function
Configuration‐based approach for topological problems in the design of wireless sensor networks
The multicovering problem
The minimum weighted covering location problem with distance constraints
Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
A projection method for the uncapacitated facility location problem
Plant location with minimum inventory
An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
The capacitated plant location problem
Location of slaughterhouses under economies of scale
A Probabilistic Analysis of the K-Location Problem
A method for solving to optimality uncapacitated location problems
Recent trends in combinatorial optimization
Domination analysis of combinatorial optimization problems.
A model for the capacitated \(p\)-facility location problem in global environments
An improved Lagrangian relaxation and dual ascent approach to facility location problems
A note on the maximization version of the multi-level facility location problem
A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
A double annealing algorithm for discrete location/allocation problems
An analysis of approximations for maximizing submodular set functions—I
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Exact solution of two location problems via branch-and-bound
Stochastic block-coordinate gradient projection algorithms for submodular maximization
Adaptive algorithms on maximizing monotone nonsubmodular functions
Discrete facility location in machine learning
Constrained submodular maximization via a nonsymmetric technique
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

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)