Abstract: | To various problems of combinatorial optimization we consider the question how the value of the optimal solution resp. the values of some approximative solutions are predetermined with high probability to a given distribution. We present results to probabilistic analysis of heuristics. We consider the problems Traveling Salesman, Minimum Perfect Matching. Minimum Spanning Tree, Linear Optimization, Bin Packing, Multi-processor-Scheduling, Subset Sum and some problems to random graphs. |