Weight reduction problems with certain bottleneck objectives

European Journal of Operational Research

Volumn 153, Issue 1, 2004, Pages 191-199

  Burkard, Rainer E ^a   Lin, Yixun ^b   Zhang, Jianzhong ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b ZHENGZHOU UNIVERSITY   (China)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bottleneck problem; Capacity expansion; Computational complexity; Transversal set; Weight reduction

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BOTTLENECK PROBLEMS; CAPACITY EXPANSION; TRANSVERSAL SET; WEIGHT REDUCTION;

OPERATIONS RESEARCH;

EID: 0142031053     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00713-0     Document Type: Conference Paper

References (20)

1. Berman O., Ingco D.I., Odoni A.R. Improving the location of minimum facilities through network modification. Annals of Operations Research. 40:1992;1-16.
2. Berman O., Ingco D.I., Odoni A.R. Improving the location of minimax facilities through network modification. Networks. 24:1994;31-41.
3. Burkard R.E., Klinz B., Zhang J. Bottleneck capacity expansion problems with eneral budget constraints. RAIRO Recherche Opérationelle. 35:2001;1-20.
4. Burton D., Toint Ph.L. On an instance of the inverse shortest paths problem. Mathematical Programming. 53:1992;45-61.
5. Drangmeister K.U., Krumke S.O., Marathe M.V., Noltemeier H., Ravi S.S. Modifying edges of a network to obtain short subgraphs. Theoretical Computer Science. 203:1998;91-121.
6. Frederickson G.N., Solis-Oba R. Increasing the weight of minimum spanning trees. Journal of Algorithms. 33:1999;244-266.
7. Fulkerson D.R. Increasing the capacity of a network: The parametric budget problem. Management Science. 5:1959;472-483.
8. Fulkerson D.R., Harding G.C. Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming. 13:1977;116-118.
9. C. Heuberger, Inverse optimization: A survey on problems, methods, and results. Report 219, Spezialforschungsbereich Optimierung und Kontrolle, Universität Graz und Technische Universität Graz, 2001. Available from 〈ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb219.ps.gz〉 Journal of Combinatorial Optimization, in press.
10. Krumke S.O., Marathe M.V., Noltemeier H., Ravi R., Ravi S.S. Approximation algorithms for certain network improvement problems. Journal of Combinatorial Optimization. 2:1998;257-288.
11. Krumke S.O., Marathe M.V., Noltemeier H., Ravi R., Wirth H.-C. Upgrading bottleneck constrained forests. Discrete Applied Mathematics. 108:2001;129-142.
12. Megiddo N. Combinatorial optimization with rational objective functions. Mathematics of Operations Research. 4:1979;414-424.
13. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM. 30:1983;852-865.
14. C. Phillips, The network inhibition problem, in: Proceedings of the 25th Annual Symposium on the Theory of Computing, 1993, pp. 776-785.
15. Radzik T. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. Pardalos P.M. Complexity in Numerical Optimization. 1993;351-386 World Scientific Publ.
16. Stoer M., Wagner F. A simple min-cut algorithm. Journal of the ACM. 44:1997;585-591.
17. Yang C., Zhang J. Inverse maximum capacity problem. Operations Research Spektrum. 20:1998;97-100.
18. Zhang J., Liu Z., Ma Z. Some reverse location problems. European Journal of Operational Research. 124:2000;77-88.
19. Zhang J., Yang X.G., Cai M.C. Reverse center location problem. Aggarwal A., Pandu Rangan C. Algorithms and Computation, 10th International Symposium, ISAAC' 99, Proceedings, Chennai, India, December 16-18, 1999. Lecture Notes in Computer Science. vol. 1741:1999;279-294 Springer.
20. Zhang J., Yang C., Lin Y. A class of bottleneck expansion problems. Computer and Operations Research. 28:2001;505-519.