This paper addresses an inconsistency in various definitions of supported non‐dominated points within multi‐objective integer linear optimization problems (MOILPs). MOILP problems are known to contain supported and unsupported non‐dominated points, with the latter typically outnumbering...

Our aim in this thesis is to propose efficient algorithms for solving difficult combinatorial optimization problems. Our algorithms are based on a generic method of ordered enumeration. Initially, we describe the principle of ordered enumeration which consists in generating in a specific order...

This paper presents several methodological and algorithmic improvements over a state-of-the-art dynamic programming algorithm for solving the bi-objective {0,1} knapsack problem. The variants proposed make use of new definitions of lower and upper bounds, which allow a large number of states to...