A class of bottleneck expansion problems

Computers and Operations Research

Volumn 28, Issue 6, 2001, Pages 505-519

  Zhang, Jianzhong ^a   Yang, Chao ^a   Lin, Yixun ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Bottleneck problem; Inverse optimization problem; Minimum weight element problem; Parametric linear programming; Polynomial algorithm

Indexed keywords

LINEAR PROGRAMING;

ALGORITHMS; BUDGET CONTROL; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

POLYNOMIAL ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0035324683     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00130-6     Document Type: Article

References (19)

1. Constrained matroidal bottleneck problems
2. The constrained bottleneck problem in networks
3. Lexicographic bottleneck problems
4. Efficiently solvable special cases of bottleneck traveling salesman problem
5. The minimax spanning tree problem and some extensions
6. An augmenting path method for solving linear bottleneck assignment problems
7. Bottleneck extrema
8. Maximizing the minimum source-sink path subject to a budget constraint
9. Algorithms for two bottleneck optimization problems
10. An improved algorithm for the bottleneck assignment problem
11. Generalized bottleneck problems
12. Lexicographic bottleneck combinatorial problems
13. Inverse maximum capacity problems
14. Two general methods for inverse optimization problems
15. A network flow method for solving some inverse combinatorial optimization problems
16. A further study on inverse linear programming problems
17. Some reverse location problems