An approximate algorithm for combinatorial optimization problems with two parameters

Australasian Journal of Combinatorics

Volumn 14, Issue , 1996, Pages 157-164

  Blokh, David ^a   Gutin, Gregory ^b,c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b BRUNEL UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10644287275     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Y.P. Aneja, V. Aggarwal and K.P.K. Nair, "Shortest chain subject to side constraints", Networks 13, 295-302 (1983).
2. M.R. Garey and D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. S.E. Gvozdev, "On two discrete optimization problems", In Upravliaemye systemy, Novosibirsk, 19 22-30 (1979) (in Russian).
4. G. Handler and I. Zang, "A dual algorithm for the constrained shortest path problem", Networks 10, 293-310 (1980).
5. R. Hassin, "Approximation schemes for the restricted shortest path problem", Math. Oper. Res. 17, 36-42 (1992).
6. M. Henig, "The shortest path problem with two objective functions", European J. Oper. Res. 25, 281-291 (1985).
7. H.C. Joksch, The shortest route problem with constraints, J. Math. Anal. Appl. 14, 191-197 (1966).
8. E.L. Lawler, Combinatorial Optimization: Networks and Mathroids, Hold, Rinehart and Winston, New York, 1976.
9. I.I. Melamed, S.I. Sergeev, and I. Kh. Sigal, "The Traveling Salesman Problem: Part 1, Theoretical Issues", Automation and Remote Control 50 1147-1173 (1989).
10. B.M.E. Moret and H.D. Shapiro, "How to find a minimum spanning tree in practice", Lecture Notes in CS 555, 192-203 (1991).
11. S.A. Morozov, "On the minimum spanning tree problem with restrictions" In Upravliaemye systemy, Novosibirsk, 15, 40-47 (1976) (in Russian).
12. C.A. Phillips, "The network inhibition problem", in Proc. 25th Ann. ACM Symp. Theory Computing, 776-785 (1993).
13. M.J. Rosenblatt, Z. Sinuani-Stern, "Generating the discrete efficient frontier to the capital budgeting problem", Oper. Res., 37, 384-394 (1987).
14. H.A. Taha, Operation Research: An Introduction, New York, 1992.
15. A. Warburton, "Approximation of Pareto optima in multi-objective, shortest path problems", Oper. Res. 35, 70-79 (1987).