Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
From MaRDI portal
Cited in
(63)- A note on submodular set cover on matroids
- Directed submodularity, ditroids and directed submodular flows
- Submodularity and valid inequalities in capacitated fixed charge networks
- A note on maximizing a submodular set function subject to a knapsack constraint
- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- Maximizing expected utility over a knapsack constraint
- The simple plant location problem: Survey and synthesis
- An analysis of the greedy algorithm for the submodular set covering problem
- Multi-pass streaming algorithms for monotone submodular function maximization
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
- Packing under convex quadratic constraints
- Dual domination problems in graphs
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Streaming algorithms for maximizing DR-submodular functions with d-knapsack constraints
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
- Submodular optimization problems and greedy strategies: a survey
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
- Maximize a monotone function with a generic submodularity ratio
- Constrained submodular maximization via greedy local search
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Cut problems in graphs with a budget constraint
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Streaming submodular maximization under \(d\)-knapsack constraints
- On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice
- Practical budgeted submodular maximization
- Hub location as the minimization of a supermodular set function
- Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline
- Scenario submodular cover
- Maximizing set function formulation of two scheduling problems
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Non-submodular maximization with matroid and knapsack constraints
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
- Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Energy-constrained geometric coverage problem
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
- On maximizing k-submodular functions under p-system and d-knapsack constraints
- Monotone submodular maximization under the pairwise capacity constraint
- Recoverable robust cardinality constrained maximization with commitment of a submodular function
- Maximize an approximate k-submodular function under a knapsack constraint
- Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
- Practical parallel algorithms for non-monotone submodular maximization
- Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity
- An exact solver for submodular knapsack problems
- Modified greedy algorithm for monotone submodular maximization with knapsack and partition matroid constraints
- Approximation algorithms for k-submodular maximization subject to a knapsack constraint
- Recoverable robust cardinality constrained maximization with commitment of a submodular function
- Competitive facility location and design problem
This page was built for publication: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964292)
