Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach

European Journal of Operational Research

Volumn 147, Issue 3, 2003, Pages 657-664

  Ehrgott, Matthias ^a   Skriver, Anders J V ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Combinatorial optimization; Max ordering problems; Multiple objective programming; Ranking methods

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; PARETO PRINCIPLE; PROBLEM SOLVING;

RANKING METHODS;

COMBINATORIAL MATHEMATICS;

EID: 0037449215     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00353-3     Document Type: Article

References (37)

1. Azevedo J.A., Santos Costa M.E.O., Silvestre Madeira J.J.E.R., Martins E.Q.V. An algorithm for the ranking of shortest paths. European Journal of Operational Research. 69:1993;97-106.
2. Benayoun R., de Montgolfier J., Tergny J., Laritchev O. Linear programming with multiple objective functions: Step method (stem). Mathematical Programming. 1(3):1971;366-375.
3. Brucker P.J., Hamacher H.W. k-optimal solution sets for some polynomially solvable scheduling problems. European Journal of Operational Research. 41:1989;194-202.
4. Buchanan J.T. A naive approach for solving MCDM problems. Journal of the Operational Research Society. 48(2):1997;202-206.
5. Camerini P., Vercellis C. The matroidal knapsack: A class of (often) well-solvable problems. Operations Research Letters. 3(3):1984;157-162.
6. Camerini P.M., Hamacher H.W. Intersection of two matroids: (condensed) Border graphs and ranking. SIAM Journal of Algebaric and Discrete Methods. 2:1989;16-27.
7. Chegireddy C.R., Hamacher H.W. Algorithms for finding k-best perfect matchings. Discrete Applied Mathematics. 18:1987;155-165.
8. Chung S., Hamacher H.W., Maffioli F., Murty K.G. Note on combinatorial optimization with max-linear objective functions. Discrete Applied Mathematics. 42:1993;139-145.
9. Coutinho-Rodrigues J.M., Climaco J.C.N., Current J.R. An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions. Computers and Operations Research. 26(8):1999;789-798.
10. Ehrgott M. On matroids with multiple objectives. Optimization. 38(1):1996;73-84.
11. Ehrgott M. Integer solutions of multicriteria network flow problems. Investigacao Operacional. 19:1999;229-243.
12. Ehrgott M. Approximation algorithms for combinatorial multicriteria optimization problems. International Transactions in Operational Research. 7:2000;5-31.
13. Ehrgott M. Multicriteria optimization. Number 491 in Lecture Notes in Economics and Mathematical Systems. 2000;Springer, Berlin.
14. Ehrgott M., Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. Operations Research Spektrum. 22:2000;425-460.
15. Ehrgott M., Nickel S., Hamacher H.W. Geometric methods to solve max-ordering location problems. Discrete Applied Mathematics. 93:1999;3-20.
16. M. Ehrgott, D. Tenfelde, Computation of ideal and Nadir values and implications for their use in MCDM methods. European Journal of Operational Research, forthcoming.
17. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing. 28(2):1998;652-673.
18. Gabow H.N. Two algorithms for generating weighted spanning trees in order. SIAM Journal of Computing. 6(1):1977;139-150.
19. Hamacher H.W. A note on K-best network flows. Annals of Operations Research. 57:1995;65-72. Special Volume "Industrial Systems"
20. Hamacher H.W., Queyranne M. K-best solutions to combinatorial optimization problems. Annals of Operations Research. 4:1985;123-143.
21. Hamacher H.W., Ruhe G. On spanning tree problems with multiple objectives. Annals of Operations Research. 52:1994;209-230.
22. Katoh N., Ibaraki T., Mine H. An algorithm for finding k minimum spanning trees. SIAM Journal of Computing. 10(2):1981;247-255.
23. Kouvelis P., Yu G. Robust Discrete Optimization and Its Applications. 1998;Kluwer Academic Publishers, Dordrecht.
24. Lawler E.L. A procedure for computing the k-best solutions to discrete optimization problems and its application to the shortest path problem. Management Science. 18:1972;401-405.
25. Lee H., Pulat P.S. Bicriteria network flow problems: Integer case. European Journal of Operational Research. 66:1993;148-157.
26. Martins E.Q.V., Pascoal M.M.B., Dos Santos J.L.E. Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science. 10(3):1999;247-261.
27. E.Q.V. Martins, M.M.B. Pascoal, J.L.E. Dos Santos, A new improvement for a k shortest paths algorithm, Technical report, Universidade de Coimbra, 2000.
28. Murthy I., Her S.S. Solving min-max shortest-path problems on a network. Naval Research Logistics. 39:1992;669-683.
29. Ramos R.M., Alonso S., Sicilia J., González C. The problem of the optimal biobjective spanning tree. European Journal of Operational Research. 111:1998;617-628.
30. Rana K., Vickson R.G. A model and solution algorithm for optimal routing of a time-chartered containership. Transportation Science. 22:1988;83-96.
31. Solanki R.S., Appino P.A., Cohon J.L. Approximating the noninferior set in multiobjective linear programming problems. European Journal of Operational Research. 68:1993;356-373.
32. Steuer R.E. Multiple Criteria Optimization: Theory, Computation and Application. 1985;John Wiley & Sons, New York.
33. Steuer R.E., Choo E.U. An interactive weighted Tchebycheff procedure for multiple objective programming. Mathematical Programming. 26:1983;326-344.
34. E.L. Ulungu, J. Teghem, Application of the two phases method to solve the bi-objective knapsack problem. Technical report, Faculté Polytechnique de Mons, Belgium, 1994.
35. Ulungu E.L., Teghem J. The two-phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences. 20(2):1994;149-165.
36. Visée M., Teghem J., Pirlot M., Ulungu E.L. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. Journal of Global Optimization. 12:1998;139-155.
37. Warburton A. Aproximation of pareto optima in multiple-objective shortest-path problems. Operations Research. 35(1):1987;70-79.