Pages that link to "Item:Q1801679"

The following pages link to A probabilistic analysis of the maximal covering location problem (Q1801679):

Displaying 9 items.

• The multimode covering location problem (Q342251) (← links)
• Multimode extensions of combinatorial optimization problems (Q510906) (← links)
• An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
• Optimal approximability of bookmark assignments (Q2444527) (← links)
• Cut problems in graphs with a budget constraint (Q2457298) (← links)
• Improved approximation of maximum vertex cover (Q2583713) (← links)
• Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
• Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)