Pages that link to "Item:Q543403"

The following pages link to Maximizing a class of submodular utility functions (Q543403):

Displaying 35 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)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• Submodular function minimization and polarity (Q2097629) (← links)
• Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
• Dynamic node packing (Q2097666) (← links)
• Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
• An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
• Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
• Submodular optimization problems and greedy strategies: a survey (Q2197586) (← 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)
• A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
• Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
• Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
• Route optimization for multiple searchers (Q3065632) (← links)
• A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)
• The stochastic pseudo-star degree centrality problem (Q6112539) (← links)
• Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)