A class of bottleneck expansion problems
From MaRDI portal
Publication:5936134
DOI10.1016/S0305-0548(99)00130-6zbMath0991.90113OpenAlexW2135208558MaRDI QIDQ5936134
Zhang, Jianzhong, Yanpei Liu, Chao Yang
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00130-6
polynomial algorithmbottleneck probleminverse optimization problemminimum-weight element problemparameter linear programming
Related Items
An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems, Expanding maximum capacity path under weighted sum-type distances, The capacity expansion path problem in networks, Weight reduction problems with certain bottleneck objectives., On the optimum capacity of capacity expansion problems, Bottleneck Capacity Expansion Problems with General Budget Constraints, The optimization of road building schedule based on budget restriction, A class of node based bottleneck improvement problems
Cites Work
- Unnamed Item
- Unnamed Item
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Lexicographic bottleneck problems
- An augmenting path method for solving linear bottleneck assignment problems
- The Min-Max Spanning Tree Problem and some extensions
- A further study on inverse linear programming problems
- Lexicographic bottleneck combinatorial problems
- Inverse maximum capacity problems
- Some reverse location problems
- Two general methods for inverse optimization problems
- Constrained matroidal bottleneck problems
- The Constrained Bottleneck Problem in Networks
- Algorithms for two bottleneck optimization problems
- Maximizing the minimum source-sink path subject to a budget constraint
- Generalized Bottleneck Problems∗
- Bottleneck extrema
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- A network flow method for solving some inverse combinatorial optimization problems
