Bottleneck capacity expansion problems with general budget constraints

RAIRO - Operations Research

Volumn 35, Issue 1, 2001, Pages 1-20

  Burkard, Rainer E ^a   Klinz, Bettina ^a   Zhang, Jianzhong ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algebraic optimization; Bottleneck problem; Capacity expansion; Strongly polynomial algorithm

Indexed keywords

ALGORITHMS; BUDGET CONTROL; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; SET THEORY;

BOTTLENECK CAPACITY EXPANSION PROBLEM; BUDGET CONSTRAINTS; STRONGLY POLYNOMIAL ALGORITHM;

OPERATIONS RESEARCH;

EID: 0034965005     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2001100     Document Type: Article

References (17)

1. R.K. Ahuja and J.B. Orlin, A capacity scaling algorithm for the constrained maximum flow problem. Networks 25 (1995) 89-98.
2. R.E. Burkard, K. Dlaska and B. Klinz, The quickest flow problem. Z. Oper. Res. (ZOR) 37 (1993) 31-58.
3. R.E. Burkard, W. Hahn and U. Zimmermann, An algebraic approach to assignment problems. Math. Programming 12 (1977) 318-327.
4. R.E. Burkard and U. Zimmermann, Combinatorial optimization in linearly ordered semimodules: A survey, in Modern Applied Mathematics, edited by B. Korte. North Holland, Amsterdam (1982) 392-436.
5. K.U. Drangmeister, S.O. Krumke, M.V. Marathe, H. Noltemeier and S.S. Ravi, Modifying edges of a network to obtain short subgraphs. Theoret. Comput. Sci. 203 (1998) 91-121.
6. G.N. Frederickson and R. Solis-Oba, Increasing the weight of minimum spanning trees. J. Algorithms 33 (1999) 244-266.
7. G.N. Frederickson and R. Solis-Oba, Algorithms for robustness in matroid optimization, in Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (1997) 659-668.
8. D.R. Fulkerson and G.C. Harding, Maximizing the minimum source-sink path subject to a budget constraint. Math. Programming 13 (1977) 116-118.
9. A. Jüttner, On budgeted optimization problems. Private Communication (2000).
10. S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi and S.S. Ravi, Approximation algorithms for certain network improvement problems. J. Combin. Optim. 2 (1998) 257-288.
11. N. Megiddo, Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 (1979) 414-424.
12. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30 (1983) 852-865.
13. th Annual Symposium on the Theory of Computing (1993) 776-785.
14. T. Radzik, Parametric flows, weighted means of cuts, and fractional combinatorial optimization, in Complexity in Numerical Optimization, edited by P.M. Pardalos. World Scientific Publ. (1993) 351-386.
15. J. Zhang, C. Yang and Y. Lin, A class of bottleneck expansion problems. Comput. Oper. Res. 28 (2001) 505-519.
16. U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures.
17. North-Holland, Amsterdam, Ann. Discrete Math. 10 (1981).