Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data isNP-Hard
SIAM Journal on Matrix Analysis and Applications
On optimal solution of interval linear equations
SIAM Journal on Numerical Analysis
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Solving linear systems whose input data are rational functions of interval parameters
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Parallel execution in metaheuristics for the problem of solving parametric interval linear systems
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Heterogeneous multi-agent evolutionary system for solving parametric interval linear systems
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
| Hi-index | 0.00 |
The problem of computing a hull solution of parametric interval linear systems with general dependencies is considered. It can be reduced to the problem of solving a family of constrained optimizatiom problems. In this study, different metaheuristics are used to solve those problems. Comparison of evolutionary algorithm, simulated annealing and tabu search algorithm together with analysis of variance tests are provided on the basis of three different practical problems.