A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem

Authors:
Abraham P. Punnen;K. P. K. Nair
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 4

The bottleneck 2-connected k-Steiner network problem for k≤2

Discrete Applied Mathematics
Minmax regret solutions for minimax optimization problems with uncertainty

Operations Research Letters
Experimental analysis of heuristics for the bottleneck traveling salesman problem

Journal of Heuristics
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract