An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs

References

• Aneja Y. P., Nair K. P. Bicriteria transportation problem. Management Sci. (1979) 25(1):73–78Link, Google Scholar
• Benson H. P., Sun E. Outcome space partition of the weight set in multiobjective linear programming. Optim. Theory Appl. (2000) 105(1):17–36Crossref, Google Scholar
• Benson H. P., Sun E. A weight decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. Eur. J. Oper. Res. (2002) 139(1):26–41Crossref, Google Scholar
• Cohon J. L.Multiobjective Programming and Planning (1978) (Academic Press, New York) Google Scholar
• Ehrgott M.Multicriteria Optimization (2005) 2nd ed.(Springer, Berlin) Google Scholar
• Kalai G., Bisztriczky T., McMullen P., Schneider R., Weiss A. I. Some aspects of the combinatorial theory of convex polytopes. Polytopes, Abstract Convex and Computational (1995) (Springer, Berlin) 205–230Google Scholar
• Nemhauser G., Wolsey L. A.Integer and combinatorial optimization (1988) (John Wiley & Sons, New York) Crossref, Google Scholar
• Özpeynirci Ö. Approaches for multiobjective combinatorial optimization problems. (2008) . Ph.D. thesis, Middle East Technical University, Ankara, TurkeyGoogle Scholar
• Phelps S. P., Köksalan M. An interactive evolutionary metaheuristic for multiobjective combinatorial optimization. Management Sci. (2003) 49(12):1726–1738Link, Google Scholar
• Przybylski A., Gandibleux X., Ehrgott M. A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. (2010) 22(3):371–386Link, Google Scholar
• Solanki R. S., Appino P. A., Cohon J. L. Approximating the noninferior set in multiobjective linear programming problems. Eur. J. Oper. Res. (1993) 68(3):356–373Crossref, Google Scholar
• Steuer R. E.Multiple Criteria Optimization: Theory, Computation and Application (1986) (John Wiley & Sons, New York) Google Scholar
• Steuer R. E.ADBASE Multiple Objective Linear Programming Package (1989) (Department of Management Science and Information Technology, University of Georgia, Athens) Google Scholar
• Tenfelde-Podehl D. A recursive algorithm for multiobjective combinatorial problems with Q criteria. (2003) . Technical report, University of Graz, Graz, AustriaGoogle 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(2):139–155Crossref, Google Scholar