Pages that link to "Item:Q4135210"

The following pages link to Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (Q4135210):

Displaying 50 items.

• Multi-level facility location problems (Q1754251) (← links)
• Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
• On a connection between facility location and perfect graphs (Q1785286) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
• A gamma heuristic for the \(p\)-median problem (Q1806941) (← links)
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
• Assessment of approximate algorithms: The error measure's crucial role (Q1820671) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• The simple plant location problem: Survey and synthesis (Q1837098) (← links)
• On approximation of max-vertex-cover (Q1848386) (← links)
• A note on the maximization version of the multi-level facility location problem (Q1866995) (← links)
• A maximal covering location model in the presence of partial coverage (Q1881656) (← links)
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
• Locating flow-intercepting facilities: New approaches and results (Q1908283) (← links)
• A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
• PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
• Search complexity: a way for the quantitative analysis of the search space (Q2039682) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• Optimal intervention in economic networks using influence maximization methods (Q2116936) (← links)
• Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
• Stochastic makespan minimization in structured set systems (Q2118147) (← links)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
• Joint chance constrained shortest path problem with Copula theory (Q2185821) (← links)
• Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms (Q2256166) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• Influence maximization with deactivation in social networks (Q2424770) (← links)
• Location of slaughterhouses under economies of scale (Q2433439) (← links)
• Inequalities on submodular functions via term rewriting (Q2444736) (← links)
• The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) (← links)
• The approximation gap for the metric facility location problem is not yet closed (Q2467481) (← links)
• Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
• A fast swap-based local search procedure for location problems (Q2480210) (← links)
• Product line selection and pricing analysis: impact of genetic relaxations (Q2489113) (← links)
• Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
• A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
• Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
• A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)
• Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
• A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)