Pages that link to "Item:Q5172726"

The following pages link to Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726):

Displaying 37 items.

• Matroid and knapsack center problems (Q300451) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
• Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
• A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
• Maximizing a submodular function with viability constraints (Q513299) (← links)
• Blocking rumor by cut (Q721923) (← links)
• FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
• The knapsack problem with neighbour constraints (Q1932367) (← links)
• Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
• Private non-monotone submodular maximization (Q2091093) (← links)
• An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
• Measured continuous greedy with differential privacy (Q2151374) (← links)
• Viral marketing of online game by DS decomposition in social networks (Q2282998) (← links)
• Set function optimization (Q2314057) (← links)
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
• Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
• Optimization with demand oracles (Q2414860) (← links)
• Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
• Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
• Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
• Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
• (Q2958605) (← links)
• Contact Center Scheduling with Strict Resource Requirements (Q3009760) (← links)
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
• (Q5009516) (← links)
• Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
• A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
• Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
• Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
• Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations (Q6095506) (← links)
• Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
• Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint (Q6201343) (← links)
• Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models (Q6599123) (← links)
• Greedy algorithm for maximization of semi-monotone non-submodular functions with applications (Q6612543) (← links)
• Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems (Q6633554) (← links)