Maximizing a class of submodular utility functions
From MaRDI portal
Publication:543403
Recommendations
- Maximizing a class of submodular utility functions with constraints
- Risk averse submodular utility maximization
- Sequence independent lifting for a set of submodular maximization problems
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
Cites work
- scientific article; zbMATH DE number 3127846 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An analysis of approximations for maximizing submodular set functions—I
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Characteristics of Decisions in Decision Analysis Practice
- Combinatorial auctions with decreasing marginal utilities
- Competitive facility location model with concave demand
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- On a discrete nonlinear and nonseparable knapsack problem
- On maximizing welfare when utility functions are subadditive
- Optimal approximation for the submodular welfare problem in the value oracle model
- Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence independent lifting in mixed integer programming
- Submodularity and valid inequalities in capacitated fixed charge networks
- The 0-1 knapsack problem with a single continuous variable
- Theory of games and economic behavior.
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(45)- Maximizing a class of utility functions over the vertices of a polytope
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- Fractional 0-1 programming and submodularity
- A two-stage stochastic programming approach for influence maximization in social networks
- A survey on double greedy algorithms for maximizing non-monotone submodular functions
- Maximizing Non-monotone Submodular Functions
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- Submodular optimization problems and greedy strategies: a survey
- Chance-constrained set covering with Wasserstein ambiguity
- A survey on bilevel optimization under uncertainty
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Route optimization for multiple searchers
- Extremality of submodular functions
- A scenario decomposition algorithm for 0-1 stochastic programs
- Polymatroids and mean-risk minimization in discrete optimization
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- A polyhedral approach to bisubmodular function minimization
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
- Supermodular covering knapsack polytope
- Submodular Maximization Through the Lens of Linear Programming
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Supermodularity and valid inequalities for quadratic optimization with indicators
- An exact cutting plane method for \(k\)-submodular function maximization
- Dynamic node packing
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- Sequence independent lifting for a set of submodular maximization problems
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Submodular function minimization and polarity
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- The stochastic pseudo-star degree centrality problem
- Risk averse submodular utility maximization
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- An approximation algorithm for a competitive facility location problem with network effects
- Interactive optimization of submodular functions under matroid constraints
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Maximizing a class of submodular utility functions with constraints
- Submodular Maximization With Limited Function Access
- Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
- Maximizing expected utility over a knapsack constraint
This page was built for publication: Maximizing a class of submodular utility functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543403)
