Pages that link to "Item:Q543403"
From MaRDI portal
The following pages link to Maximizing a class of submodular utility functions (Q543403):
Displayed 13 items.
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- A scenario decomposition algorithm for 0-1 stochastic programs (Q2450729) (← links)
- Route optimization for multiple searchers (Q3065632) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)