The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm

References

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