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)- The multi-level uncapacitated facility location problem is not submodular
- A tree search algorithm for the p-median problem
- Differential approximation of NP-hard problems with equal size feasible solutions
- An upper bound on the number of execution nodes for a distributed join
- A tree search algorithm for the multi-commodity location problem
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- ASEAN industrial cooperation: The case of multi-product capacity expansion
- Tight approximation bounds for maximum multi-coverage
- Influence maximization problem: properties and algorithms
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Tight approximation bounds for maximum multi-coverage
- On dependent randomized rounding algorithms
- Network production-location problems under price uncertainty
- Simultaneous selection
- A Primal Approach to the Simple Plant Location Problem
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
- Phylogenetic diversity and the maximum coverage problem
- Modelling a fertiliser distribution system
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- A gamma heuristic for the \(p\)-median problem
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Optimal partitioning of a data set based on the \(p\)-median model
- NP-Complete operations research problems and approximation algorithms
- Pick-and-choose heuristics for partial set covering
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- A 6/5-approximation algorithm for the maximum 3-cover problem
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- A note on the implications of approximate submodularity in discrete optimization
- Heuristic concentration: Two stage solution construction
- The plant location problem with demand-dependent setup costs and centralized allocation
- Performance bounds with curvature for batched greedy optimization
- Algorithms for central-median paths with bounded length on trees
- Fast primal and dual heuristics for the \(p\)-median location problem
- Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors
- Developments in network location with mobile and congested facilities
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
- An extension of the \(p\)-median group technology algorithm
- Optimal sensor placement for underwater threat detection
- New performance guarantees for the greedy maximization of submodular set functions
- A cost operator approach to multistage location-allocation
- Inequalities on submodular functions via term rewriting
- Using a facility location algorithm to solve large set covering problems
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
- A heuristic method for the multi-story layout problem
- Survivable networks, linear programming relaxations and the parsimonious property
- Hooked on IP
- IP over 40+ years at IBM scientific centers and marketing
- Heuristic methods and applications: A categorized survey
- Locating flow-intercepting facilities: New approaches and results
- On the location and \(p\)-median polytopes
- Making a state-of-the-art heuristic faster with data mining
- Nash welfare guarantees for fair and efficient coverage
- Search complexity: a way for the quantitative analysis of the search space
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- Scheduling crackdowns on illicit drug markets
- A two-stage stochastic programming approach for influence maximization in social networks
- Affinity propagation and uncapacitated facility location problems
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- Optimal intervention in economic networks using influence maximization methods
- Stochastic makespan minimization in structured set systems
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Exact solution of two location problems via branch-and-bound
- The approximation gap for the metric facility location problem is not yet closed
- An efficient lagrangean relaxation scheme for linear and integer equal flow problems
- Submodular optimization problems and greedy strategies: a survey
- The Complexity of Partial Function Extension for Coverage Functions
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Product line selection and pricing analysis: impact of genetic relaxations
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Recognizing Coverage Functions
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Some remarks about the `equivalence' of performance measures in scheduling problems
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
- PASS approximation: a framework for analyzing and designing heuristics
- Multiple facility location on a network with linear reliability order of edges
- Siting renewable power generation assets with combinatorial optimisation
- Assessment of approximate algorithms: The error measure's crucial role
- Discrete facility location in machine learning
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Constrained submodular maximization via a nonsymmetric technique
- Multi-level facility location problems
- STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
- Influence maximization with deactivation in social networks
- Online submodular maximization with preemption
- Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems
- Analysis of a local search algorithm for the \(k\)-facility location problem
- Adaptive algorithms on maximizing monotone nonsubmodular functions
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Approximate separable multichoice optimization over monotone systems
- Lagrangian relaxations for multiple network alignment
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- On a connection between facility location and perfect graphs
- A distributed approximation algorithm for fault-tolerant metric facility location
- An approximation algorithm for a competitive facility location problem with network effects
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
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)
