Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
From MaRDI portal
Publication:4135210
Cited in
(only showing first 100 items - show all)- A simple filter-and-fan approach to the facility location problem
- 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
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Hooked on IP
- IP over 40+ years at IBM scientific centers and marketing
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Exact solution of two location problems via branch-and-bound
- Influence maximization problem: properties and algorithms
- 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
- Survivable networks, linear programming relaxations and the parsimonious property
- COLE: a new heuristic approach for fixed charge problem computational results
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
- A new warmstarting strategy for the primal-dual column generation method
- 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
- Heuristics for the fixed cost median problem
- Assessment of approximate algorithms: The error measure's crucial role
- Efficient computation of 2-medians in a tree network with positive/negative weights
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- Lagrangian relaxations for multiple network alignment
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- Facility location models for distribution system design
- Optimal intervention in economic networks using influence maximization methods
- Stochastic makespan minimization in structured set systems
- A dual ascent approach for steiner tree problems on a directed graph
- Optimal partitioning of a data set based on the \(p\)-median model
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Scheduling crackdowns on illicit drug markets
- The \(p\)-median problem: a survey of metaheuristic approaches
- The multi-level uncapacitated facility location problem is not submodular
- On the linear relaxation of the \(p\)-median problem
- Heuristics for the capacitated plant location model
- 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
- Influence maximization with deactivation in social networks
- On approximation of max-vertex-cover
- A gamma heuristic for the \(p\)-median problem
- Algorithms for central-median paths with bounded length on trees
- An efficient tabu search procedure for the \(p\)-median problem
- Multi-level facility location problems
- Worst-Case Analysis of Network Design Problem Heuristics
- Integer programming formulations of discrete hub location problems
- 2-medians in trees with pos/neg weights
- An approximation algorithm for a competitive facility location problem with network effects
- Heuristic methods and applications: A categorized survey
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Tight approximation bounds for maximum multi-coverage
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Exemplar-based clustering via simulated annealing
- Performance bounds with curvature for batched greedy optimization
- Heuristic concentration: Two stage solution construction
- Nash welfare guarantees for fair and efficient coverage
- Tight approximation bounds for maximum multi-coverage
- Making a state-of-the-art heuristic faster with data mining
- The Complexity of Partial Function Extension for Coverage Functions
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A family of facets for the uncapacitated \(p\)-median polytope
- On the \(p\)-median polytope of \(Y\)-free graphs
- A note on the implications of approximate submodularity in discrete optimization
- Locating flow-intercepting facilities: New approaches and results
- Search complexity: a way for the quantitative analysis of the search space
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- Fast primal and dual heuristics for the \(p\)-median location problem
- Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems
- Lagrangean heuristics for location problems
- Computational study of large-scale \(p\)-median problems
- A Lagrangean dual ascent algorithm for simple plant location problems
- Recognizing Coverage Functions
- A two-phase tabu search approach to the location routing problem
- Phylogenetic diversity and the maximum coverage problem
- On the location and \(p\)-median polytopes
- STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
- A Lagrangian search method for the \(P\)-median problem
- Multi-level facility location as the maximization of a submodular set function
- Uncapacitated and capacitated facility location problems
- The generalized maximal covering location problem
- Developments in network location with mobile and congested facilities
- Heuristics for the multi-resource generalized assignment problem
- Strategic design of distribution systems with economies of scale in transportation
- Affinity propagation and uncapacitated facility location problems
- An upper bound on the number of execution nodes for a distributed join
- Inequalities on submodular functions via term rewriting
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
- 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
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Analysis of a local search algorithm for the \(k\)-facility location problem
- A two-stage stochastic programming approach for influence maximization in social networks
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- The plant location problem with demand-dependent setup costs and centralized allocation
- A cost operator approach to multistage location-allocation
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)
