Multi-objective integer programming: An improved recursive algorithm

Abstract

This paper introduces an improved recursive algorithm to generate the set of all nondominated objective vectors for the Multi-Objective Integer Programming (MOIP) problem. We significantly improve the earlier recursive algorithm of Özlen and Azizoğlu by using the set of already solved subproblems and their solutions to avoid solving a large number of IPs. A numerical example is presented to explain the workings of the algorithm, and we conduct a series of computational experiments to show the savings that can be obtained. As our experiments show, the improvement becomes more significant as the problems grow larger in terms of the number of objectives.

11 pages, 6 tables; v2: added more details and a computational study

References in corpus (1)

• Optimising a nonlinear utility function in multi-objective integer programming

Cited by in corpus (8)

• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• Effective anytime algorithm for multiobjective combinatorial optimization problems
• Quantum Approximate Multi-Objective Optimization
• An Extension of the Non-Inferior Set Estimation Algorithm for Many Objectives
• An Extension of the Non-Inferior Set Estimation Algorithm for Many Objectives
• Multi-Objective Mixed Integer Programming: An Objective Space Algorithm
• Enhancing Branch-and-Bound for Multi-Objective 0-1 Programming
• A parallel approach to bi-objective integer programming