Pages that link to "Item:Q1977861"

The following pages link to Facility dispersion problems under capacity and cost constraints (Q1977861):

Displaying 8 items.

• Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
• Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
• A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)