Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
From MaRDI portal
(Redirected from Publication:4135210)
Cited in
(only showing first 100 items - show all)- Approximability of minimum AND-circuits
- Aggregation error for location models: Survey and analysis
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Exemplar-based clustering via simulated annealing
- Heuristics for the capacitated plant location model
- A comparison of two dual-based procedures for solving the p-median problem
- A tree search algorithm for the multi-commodity location problem
- ASEAN industrial cooperation: The case of multi-product capacity expansion
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A heuristic method for the multi-story layout problem
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- Pick-and-choose heuristics for partial set covering
- Developments in network location with mobile and congested facilities
- A comparative study of approaches to dynamic location problems
- A cost operator approach to multistage location-allocation
- A graph theoretical bound for the p-median problem
- Reducibility of minimax to minisum 0-1 programming problems
- An upper bound on the number of execution nodes for a distributed join
- A tree search algorithm for the p-median problem
- Surrogate duality relaxation for job shop scheduling
- Locational analysis
- Fast primal and dual heuristics for the \(p\)-median location problem
- The multicovering problem
- Valid inequalities and facets of the capacitated plant location problem
- Scheduling crackdowns on illicit drug markets
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- An efficient tabu search procedure for the p-median problem
- Heuristic concentration: Two stage solution construction
- Plant location with minimum inventory
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Some remarks about the `equivalence' of performance measures in scheduling problems
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Integer programming formulations of discrete hub location problems
- An extension of the \(p\)-median group technology algorithm
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
- A heuristic for large-size p-median location problems with application to school location
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- Solving the anti-covering location problem using Lagrangian relaxation
- A model for the capacitated p-facility location problem in global environments
- A double annealing algorithm for discrete location/allocation problems
- The capacitated plant location problem
- Domination analysis of combinatorial optimization problems.
- Budget constrained location problem with opening and closing of facilities.
- 2-medians in trees with pos/neg weights
- Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A two-phase tabu search approach to the location routing problem
- Making a state-of-the-art heuristic faster with data mining
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- A Lagrangian search method for the \(P\)-median problem
- Multiple facility location on a network with linear reliability order of edges
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Lagrangian relaxations for multiple network alignment
- A two-stage stochastic programming approach for influence maximization in social networks
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
- An approximation algorithm for a competitive facility location problem with network effects
- Multi-level facility location problems
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- On a connection between facility location and perfect graphs
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Lagrangean heuristics for location problems
- The plant location problem with demand-dependent setup costs and centralized allocation
- A gamma heuristic for the \(p\)-median problem
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- Assessment of approximate algorithms: The error measure's crucial role
- Heuristic methods and applications: A categorized survey
- The simple plant location problem: Survey and synthesis
- On approximation of max-vertex-cover
- A note on the maximization version of the multi-level facility location problem
- A maximal covering location model in the presence of partial coverage
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- Locating flow-intercepting facilities: New approaches and results
- A 6/5-approximation algorithm for the maximum 3-cover problem
- PASS approximation: a framework for analyzing and designing heuristics
- Search complexity: a way for the quantitative analysis of the search space
- Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Optimal intervention in economic networks using influence maximization methods
- Tight approximation bounds for maximum multi-coverage
- Stochastic makespan minimization in structured set systems
- Siting renewable power generation assets with combinatorial optimisation
- 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
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
- Joint chance constrained shortest path problem with Copula theory
- Submodular optimization problems and greedy strategies: a survey
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- The minimum weighted covering location problem with distance constraints
- Influence maximization with deactivation in social networks
- Location of slaughterhouses under economies of scale
- Inequalities on submodular functions via term rewriting
- The maximum vertex coverage problem on bipartite graphs
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- The approximation gap for the metric facility location problem is not yet closed
- Stochastic facility location with general long-run costs and convex short-run costs
- A fast swap-based local search procedure for 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)
