A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves theb hitherto best-known solution, which has a running time of 0( m + n log n), where m and n are the number of ...

Many real-world optimization problems involve multiple objectives which are often conflicting. When conventional heuristic search algorithms such as A* and IDA* are used for solving such problems, then these problems have ...