On minquantile and maxcovering optimisation

DOI10.1007/BF01592247zbMath0855.90113MaRDI QIDQ1924061

Emilio Carrizosa, Frank Plastria

Publication date: 24 November 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

maximal coveringmulticriteria decision-makingparametric minquantile problemquasiconvexity assumptions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (6)

The determination of a ``least quantile of squares regression line for all quantiles ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ The β-reliable minimax and maximin location problems on a network with probabilistic weights ⋮ Undesirable facility location with minimal covering objectives ⋮ Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints

Cites Work

• Generalized concavity
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• The determination of a ``least quantile of squares regression line for all quantiles
• Least Median of Squares Regression
• On minimax optimization problems
• Stochastic Programming with Aspiration or Fractile Criteria
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On minquantile and maxcovering optimisation