An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
From MaRDI portal
Publication:4806342
DOI10.1080/10556780290027819zbMATH Open1060.90067OpenAlexW2067600269MaRDI QIDQ4806342FDOQ4806342
Authors: Jianzhong Zhang, Zhenhong Liu 
Publication date: 18 June 2003
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780290027819
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- Bottleneck extrema
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- Algorithms for two bottleneck optimization problems
- A class of bottleneck expansion problems
- Constrained matroidal bottleneck problems
- Efficiently solvable special cases of bottleneck travelling salesman problems
- The Constrained Bottleneck Problem in Networks
- Some reverse location problems
- Inverse maximum capacity problems
Cited In (7)
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- Expanding maximum capacity path under weighted sum-type distances
- Bottleneck capacity expansion problems with general budget constraints
- A class of node based bottleneck improvement problems
- An inverse model for the most uniform problem
- A class of bottleneck expansion problems
- On the optimum capacity of capacity expansion problems
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)
