Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization
From MaRDI portal
(Redirected from Publication:1874064)
Recommendations
- Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\)
- Using pillow functions to efficiently compute crude range tests
- Optimisation of a nonlinear fuzzy function
- Why intervals? Because if we allow other sets, tractable problems become intractable
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3900744 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- scientific article; zbMATH DE number 3727583 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 3561315 (Why is no real title available?)
- scientific article; zbMATH DE number 3621713 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1241506 (Why is no real title available?)
- scientific article; zbMATH DE number 1441975 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A note on the extension principle for fuzzy sets
- Computational complexity and feasibility of data processing and interval computations
- Decision-Making in a Fuzzy Environment
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- Linear programming: foundations and extensions
- Rigorous global search: continuous problems
This page was built for publication: Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874064)