Branch and bound is a well-known generic method for computing an optimal solution of a
single-objective optimization problem. Based on the idea “divide to conquer”, it consists in …

We present a new algorithm for optimizing a linear function over the set of efficient solutions
of a multiobjective integer program (MOIP). The algorithm's success relies on the efficiency …

Feasibility pump is one of the successful heuristics developed almost a decade ago for
computing high-quality feasible solutions of single-objective integer linear programs, and it …

We present the first (criterion space search) algorithm for optimizing a linear function over
the set of efficient solutions of biobjective mixed integer linear programs. The proposed …

In this paper, we consider generating a representative subset of nondominated points at a
prespecified precision in multi-objective mixed-integer programs (MOMIPs). The number of …

In this paper, we develop two algorithms to optimize a linear function over the nondominated
set of multiobjective integer programs. The algorithms iteratively generate nondominated …

We present a new heuristic algorithm to approximately generate the nondominated frontier
of bi-objective pure integer linear programs. The proposed algorithm employs a customized …

This article develops exact algorithms to generate all non-dominated points in a specified
region of the criteria space in Multi-Objective Integer Programs (MOIPs). Typically, there are …

Branch and bound methods which are based on the principle “divide and conquer” are a
well established solution approach in single-objective integer programming. In multi …

Çok amaçlı tamsayı programlama problemlerinde baskın noktaların sayısı problemin
büyüklüğüne bağlı olarak üssel bir büyüme gösterir. Bu nedenle, bu problemler için tüm …