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.

• Modeling and optimization of a spatial detection system (Q2830954) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
• Recognizing Coverage Functions (Q2944461) (← links)
• Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
• On the Location and p-Median Polytopes (Q2971602) (← links)
• A Probabilistic Analysis of the K-Location Problem (Q3136634) (← links)
• A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION (Q3173932) (← links)
• Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
• A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
• An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
• Optimal sensor placement for underwater threat detection (Q3627941) (← links)
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM (Q3632029) (← links)
• Heuristics for the fixed cost median problem (Q3929508) (← links)
• A Primal Approach to the Simple Plant Location Problem (Q3958238) (← links)
• Worst-Case Analysis of Network Design Problem Heuristics (Q3964299) (← links)
• A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
• An analysis of approximations for maximizing submodular set functions—I (Q4152030) (← links)
• NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
• An efficient lagrangean relaxation scheme for linear and integer equal flow problems (Q4224668) (← links)
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows (Q4342969) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
• Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
• On dependent randomized rounding algorithms (Q4645933) (← links)
• On the Greedy Heuristic for Continuous Covering and Packing Problems (Q4750653) (← links)
• Online Submodular Maximization with Preemption (Q4972676) (← links)
• Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
• Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
• Uncapacitated and Capacitated Facility Location Problems (Q5506717) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)
• The multi-level uncapacitated facility location problem is not submodular (Q5906501) (← links)
• Efficient computation of 2-medians in a tree network with positive/negative weights (Q5920599) (← links)
• A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
• An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. (Q5954088) (← links)
• The generalized maximal covering location problem (Q5959382) (← links)
• Affinity propagation and uncapacitated facility location problems (Q5964469) (← links)
• The multi-level uncapacitated facility location problem is not submodular (Q5967058) (← links)
• Misinformation influence minimization problem based on group disbanded in social networks (Q6071270) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
• IM2Vec: representation learning-based preference maximization in geo-social networks (Q6191627) (← links)
• Adaptive algorithms on maximizing monotone nonsubmodular functions (Q6566785) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)