An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
From MaRDI portal
Recommendations
- Bottleneck capacity expansion problems with general budget constraints
- A class of bottleneck expansion problems
- On the bottleneck capacity expansion problems on networks
- Lexicographic bottleneck problems
- Weight reduction problems with certain bottleneck objectives.
- scientific article; zbMATH DE number 894719
- Capacity expansion problem on an undirected network
- The capacity expansion problem on directed networks
- A Lot-Sizing Problem on Trees, Related to Network Design
Cites work
- A class of bottleneck expansion problems
- Algorithms for two bottleneck optimization problems
- Bottleneck extrema
- Constrained matroidal bottleneck problems
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Inverse maximum capacity problems
- Some reverse location problems
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- The Constrained Bottleneck Problem in Networks
Cited in
(7)- Expanding maximum capacity path under weighted sum-type distances
- On the optimum capacity of capacity expansion problems
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- A class of node based bottleneck improvement problems
- Bottleneck capacity expansion problems with general budget constraints
- A class of bottleneck expansion problems
- An inverse model for the most uniform problem
This page was built for publication: An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806342)
