Maximizing a class of submodular utility functions
From MaRDI portal
Publication:543403
DOI10.1007/S10107-009-0298-1zbMATH Open1218.90221OpenAlexW2109974898MaRDI QIDQ543403FDOQ543403
Authors: S. Ahmed, Alper Atamtürk 
Publication date: 17 June 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0298-1
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
polyhedracompetitive facility locationcombinatorial auctionsexpected utility maximizationsubmodular function maximization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Auctions, bargaining, bidding and selling, and other market models (91B26) Utility theory (91B16)
Cites Work
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Title not available (Why is that?)
- Theory of games and economic behavior.
- Title not available (Why is that?)
- The 0-1 knapsack problem with a single continuous variable
- Sequence independent lifting in mixed integer programming
- Title not available (Why is that?)
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Combinatorial auctions with decreasing marginal utilities
- An analysis of approximations for maximizing submodular set functions—I
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Sequence Independent Lifting for Mixed-Integer Programming
- On maximizing welfare when utility functions are subadditive
- Competitive facility location model with concave demand
- Optimal approximation for the submodular welfare problem in the value oracle model
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Submodularity and valid inequalities in capacitated fixed charge networks
- Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
- On a discrete nonlinear and nonseparable knapsack problem
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Characteristics of Decisions in Decision Analysis Practice
Cited In (45)
- Polymatroids and mean-risk minimization in discrete optimization
- 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
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- Maximizing expected utility over a knapsack constraint
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- An approximation algorithm for a competitive facility location problem with network effects
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- The stochastic pseudo-star degree centrality problem
- Submodular Maximization With Limited Function Access
- A survey on bilevel optimization under uncertainty
- A two-stage stochastic programming approach for influence maximization in social networks
- Maximizing Non-monotone Submodular Functions
- Risk averse submodular utility maximization
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Fractional 0-1 programming and submodularity
- Extremality of submodular functions
- A polyhedral approach to bisubmodular function minimization
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Supermodularity and valid inequalities for quadratic optimization with indicators
- Submodular optimization problems and greedy strategies: a survey
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
- An exact cutting plane method for \(k\)-submodular function maximization
- Submodular Maximization Through the Lens of Linear Programming
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Chance-constrained set covering with Wasserstein ambiguity
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- A scenario decomposition algorithm for 0-1 stochastic programs
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- Interactive optimization of submodular functions under matroid constraints
- Supermodular covering knapsack polytope
- Maximizing a submodular function with viability constraints
- Maximizing a class of submodular utility functions with constraints
- Route optimization for multiple searchers
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
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)
