Minimax parametric optimization problems and multi-dimensional parametric searching
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Convex programming (90C25) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cites work
Cited in
(16)- A parametric embedding for the finite minimax problem
- Averaging the k largest distances among n: k-centra in Banach spaces
- Minimizing the sum of the \(k\) largest functions in linear time.
- Algorithmic results for ordered median problems
- Efficient algorithms for the minimum diameter bridge problem
- Building bridges between convex regions
- Parametric search: three new applications
- An efficient algorithm for the Euclidean \(r\)-centrum location problem
- Constructing the minimization diagram of a two-parameter problem
- Applications of Parametric Searching in Geometric Optimization
- Minimax Parametric Optimization Problems and Multidimensional Parametric Searching
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Large-Scale Optimization for Evaluation Functions with Minimax Search
- Smoothing method for minimizing the sum of therlargest functions
This page was built for publication: Minimax parametric optimization problems and multi-dimensional parametric searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175955)