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
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
Assessment of approximate algorithms: The error measure's crucial role
Lagrangian relaxations for multiple network alignment
Optimal intervention in economic networks using influence maximization methods
Stochastic makespan minimization in structured set systems
A tight linear time (1/2)-approximation for unconstrained submodular maximization
Scheduling crackdowns on illicit drug markets
Influence maximization with deactivation in social networks
Multi-level facility location problems
An approximation algorithm for a competitive facility location problem with network effects
Quadratic convex reformulation for quadratic programming with linear on-off constraints
Nash welfare guarantees for fair and efficient coverage
The Complexity of Partial Function Extension for Coverage Functions
Making a state-of-the-art heuristic faster with data mining
Search complexity: a way for the quantitative analysis of the search space
Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems
Recognizing Coverage Functions
STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
Affinity propagation and uncapacitated facility location problems
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
Some remarks about the `equivalence' of performance measures in scheduling problems
Analysis of a local search algorithm for the \(k\)-facility location problem
A two-stage stochastic programming approach for influence maximization in social networks
On a connection between facility location and perfect graphs
IM2Vec: representation learning-based preference maximization in geo-social networks
Misinformation influence minimization problem based on group disbanded in social networks
An efficient lagrangean relaxation scheme for linear and integer equal flow problems
Product line selection and pricing analysis: impact of genetic relaxations
Analyzing tradeoffs between zonal constraints and accessibility in facility location
A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
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
Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
Approximate separable multichoice optimization over monotone systems
Modeling and optimization of a spatial detection system
The approximation gap for the metric facility location problem is not yet closed
Multiple facility location on a network with linear reliability order of edges
Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
Joint chance constrained shortest path problem with Copula theory
Submodular optimization problems and greedy strategies: a survey

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)