The multiobjective discrete optimization problem: A weighted min-max two-stage optimization approach and a bicriteria algorithm

Management Science

Volumn 51, Issue 10, 2005, Pages 1572-1581

  Sayin, Serpil ^a   Kouvelis, Panos ^b  

^a KOÇ UNIVERSITY   (Turkey)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Bicriteria knapsack problem; Efficient set; Min max optimization; Multiple objective optimization

Indexed keywords

BICRITERIA KNAPSACK PROBLEM; EFFICIENT SET; MIN-MAX OPTIMIZATION; MULTIPLE OBJECTIVE OPTIMIZATION;

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; SET THEORY;

OPTIMIZATION;

EID: 27544470030     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1050.0413     Document Type: Review

References (24)

1. Bitran, G. R. 1977. Linear multiple objective programs with zero-one variables. Math. Programming 13 121-139.
2. Bowman, V. J. 1975. On the relationship of the Tchebycheff norm and the efficient frontier of multiple criteria objectives. Lecture Notes Econom. Math. Systems, Vol. 130. Springer Verlag, Berlin, Germany, 76-85.
3. Captivo, M. E., J. Climaco, J. Figueira, E. Martins, J. L. Santos. 2003. Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Comput. Oper. Res. 30(12) 1865-1886.
4. Chalmet, L. G., L. Lemonidis, D. J. Elzinga. 1986. An algorithm for the bi-criterion integer programming problem. Eur. J. Oper. Res. 25 292-300.
5. Ehrgott, M. 1997. Multiple Criteria Optimization: Classification and Methodology. Shaker-Verlag, Aachen, Germany.
6. Ehrgott, M., X. Gandibleux. 2000. An annotated bibliography of multi-objective combinatorial optimization. OR Spektrum 22(4) 425-160.
7. Ehrgott, M., A. J. V. Skriver. 2003. Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach. Eur. J. Oper. Res. 147 657-664.
8. Eswaran, P. K., A. Ravindran, H. Moskowitz. 1989. Algorithms for nonlinear integer bicriterion problems. J. Optim. Theory Appl. 63 261-279.
9. Henig, M. I. 1985. The shortest path problem with two objective functions. Eur. J. Oper. Res. 25 281-291.
10. ILOG. 2002. ILOG CPLEX 8.0, User Manual. ILOC, Inc., Gentilly, France.
11. Kaliszewski, I. 1987. A modified weighted Tchebycheff metric for multiple objective programming. Comput. Oper. Res. 14 315-323.
12. Kiziltan, G., E. Yucaoglu. 1983. An algorithm for multiobjective zero-one linear programming. Management Sci. 29(12) 1444-1453.
13. Klein, D., E. Hannan. 1982. An algorithm for the multiple objective integer linear programming problem. Eur. J. Oper. Res. 9 378-385.
14. Kouvelis, P., G. Yu. 1997. Robust Discrete Optimization and Its Applications, Kluwer Academic Publishers, Amsterdam, The Netherlands.
15. Lee, H., P. S. Pulat. 1993. Bicriteria network flow problems: Integer case. Eur. J. Oper. Res. 66 148-157.
16. Neumayer, P., D. Schweigert. 1994. Three algorithms for bicriteria integer linear programs. OR Spektrum 16 267-276.
17. Sayin, S. 1996. An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming. Oper. Res. Lett. 19 87-94.
18. Sayin, S. 2000. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Programming 87 543-560.
19. Steuer, R. E. 1982. On sampling the efficient set using weighted Tchebycheff metrics. Proc. Task Force Meeting on Multiobjective and Stochastic Optim., IIASA, Laxenburg, Austria, 335-351.
20. Steuer, R. E. 1986. Multiple Criteria Optimization: Theory, Computation, and Application. John Wiley and Sons, New York.
21. Steuer, R. E., E. Choo. 1983. An interactive weighted Tchebycheff procedure for multiple objective programming. Math. Programming 26 326-344.
22. Tuyttens, D., J. Teghem, P. Fortemps, K. Van Nieuwenhuyze. 2000. Performance of the MOSA method for the bicriteria assignment problem. J. Heuristics 6(3) 295-310.
23. Villareal, B., B. H. Karwan. 1981. Multicriteria integer programming: A (hybrid) dynamic programming recursive approach. Math. Programming 21 204-223.
24. Visee, M., J. Teghem, M. Pirlot, E. L. Ulungu. 1998. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Global Optim. 12 139-155.