A fast algorithm for a class of bottleneck problems
From MaRDI portal
Recommendations
- Algorithms for two bottleneck optimization problems
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
- Lexicographic bottleneck problems
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- Algorithms for two bottleneck optimization problems
- An augmenting path method for solving linear bottleneck assignment problems
- Bottleneck extrema
- Solving linear bottleneck assignment problems via strong spanning trees
- The Bottleneck Traveling Salesman Problem
- The Min-Max Spanning Tree Problem and some extensions
Cited in
(11)- Bottleneck flows in unit capacity networks
- Deterministic Graphical Games Revisited
- Quadratic bottleneck problems
- scientific article; zbMATH DE number 5524189 (Why is no real title available?)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- scientific article; zbMATH DE number 1688388 (Why is no real title available?)
- Algorithms for two bottleneck optimization problems
- The quickest path problem with batch constraints.
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
This page was built for publication: A fast algorithm for a class of bottleneck problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916054)
