The following pages link to Multiple intents re-ranking (Q5172763):
Displaying 7 items.
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- Ranking with submodular functions on a budget (Q2147409) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
