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
- Domination analysis of combinatorial optimization problems.
- The minimum weighted covering location problem with distance constraints
- On the Greedy Heuristic for Continuous Covering and Packing Problems
- A note on the maximization version of the multi-level facility location problem
- Lagrangean heuristics for location problems
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- A method for solving to optimality uncapacitated location problems
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Valid inequalities and facets of the capacitated plant location problem
- Stochastic facility location with general long-run costs and convex short-run costs
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- Budget constrained location problem with opening and closing of facilities.
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Facility location models for distribution system design
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- Heuristics for the multi-resource generalized assignment problem
- A model for the capacitated \(p\)-facility location problem in global environments
- Heuristics for the fixed cost median problem
- Location of slaughterhouses under economies of scale
- A simple filter-and-fan approach to the facility location problem
- A projection method for the uncapacitated facility location problem
- On approximation of max-vertex-cover
- Plant location with minimum inventory
- The \(p\)-median problem: a survey of metaheuristic approaches
- Heuristics for the capacitated plant location model
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- On the linear relaxation of the \(p\)-median problem
- Computational study of large-scale \(p\)-median problems
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Worst-Case Analysis of Network Design Problem Heuristics
- A graph theoretical bound for the p-median problem
- The maximum vertex coverage problem on bipartite graphs
- A comparative study of approaches to dynamic location problems
- A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
- Fast approximate energy minimization with label costs
- A Lagrangian search method for the \(P\)-median problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Exemplar-based clustering via simulated annealing
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- Surrogate duality relaxation for job shop scheduling
- Approximability of minimum AND-circuits
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Locational analysis
- Aggregation error for location models: Survey and analysis
- A Lagrangean dual ascent algorithm for simple plant 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)
