Kimia Keshanian In this study, we explore how the domain of objective function values for challenging integer programs can be reduced and whether such a reduction can improve the solution process. Our work is motivated by binary search, a technique that efficiently narrows a search space by repeatedly halving it through feasibility checks. Building on this idea, … Read more
We propose an exact binary search-based branch-and-bound algorithm, termed the Quadtree Search Method, for solving bi-objective integer programs. The existing literature on criterion space search methods for multi-objective optimization predominantly assumes that subproblems can be solved to optimality, an assumption that becomes computationally prohibitive for hard instances. In contrast, our approach departs from this assumption … Read more
In this paper, we explain some key challenges when dealing with a single/multi-objective optimization problem in practice. To overcome these challenges, we present a mathematical program that optimizes a Nash Social Welfare function. We refer to this mathematical program as the Nash Social Welfare Program (NSWP). An interesting property of the NSWP is that it … Read more