Pages that link to "Item:Q1924061"

The following pages link to On minquantile and maxcovering optimisation (Q1924061):

Displaying 10 items.

• Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← links)
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
• The determination of a ``least quantile of squares regression line'' for all quantiles (Q1350244) (← links)
• Undesirable facility location with minimal covering objectives (Q1806769) (← links)
• Smallest covering regions and highest density regions for discrete distributions (Q2155016) (← links)
• A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
• The β-reliable minimax and maximin location problems on a network with probabilistic weights (Q3057136) (← links)
• Thresholded Covering Algorithms for Robust and Max-min Optimization (Q3587385) (← links)
• (Q4319075) (← links)