Institute of Information Theories and Applications FOI ITHEA
Abstract
ATM network optimization problems defined as combinatorial optimization problems are considered.
Several approximate algorithms for solving such problems are developed. Results of their comparison by
experiments on a set of problems with random input data are presented
