Maximizing a class of submodular utility functions with constraints
From MaRDI portal
Publication:517299
Recommendations
- Maximizing a class of submodular utility functions
- Maximization of constrained non-submodular functions
- Maximizing submodular set functions subject to multiple linear constraints
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Maximization of k-submodular function with a matroid constraint
- Maximizing Non-monotone Submodular Functions
Cites work
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Benchmarking optimization software with performance profiles.
- Combinatorial auctions with decreasing marginal utilities
- Competitive facility location model with concave demand
- scientific article; zbMATH DE number 3127846 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Maximizing a class of submodular utility functions
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
- Maximizing expected utility over a knapsack constraint
- Maximizing Non-monotone Submodular Functions
- On a discrete nonlinear and nonseparable knapsack problem
- Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
- Sequence independent lifting in mixed integer programming
- The submodular knapsack polytope
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(18)- A two-stage stochastic programming approach for influence maximization in social networks
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- An exact cutting plane method for k-submodular function maximization
- Special issue: Global solution of integer, stochastic and nonconvex optimization 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
- Sequence independent lifting for a set of submodular maximization problems
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Constrained submodular maximization via greedy local search
- A polyhedral approach to bisubmodular function minimization
- A submodular optimization problem with side constraints
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- Maximizing a class of submodular utility functions
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
- Supermodularity and valid inequalities for quadratic optimization with indicators
- An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
This page was built for publication: Maximizing a class of submodular utility functions with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517299)
