Banu Lokman

Scopus Author ID
Distribution based representative sets for multi-objective integer programs
Ozarik, Sami Serkan; Lokman, Banu; Koksalan, Murat (2020-07-16)
We study and exploit the characteristics of the nondominated sets of Multi-objective Integer Programs (MOIPs). We introduce a density measure and search for common properties of the distributions of nondominated points for...
Finding a representative nondominated set for multi-objective mixed integer programs
Ceyhan, Gokhan; Koksalan, Murat; Lokman, Banu (2019-01-01)
In this paper, we develop algorithms to find small representative sets of nondominated points that are well spread over the nondominated frontiers for multi-objective mixed integer programs. We evaluate the quality of repr...
Identifying preferred solutions in multiobjective combinatorial optimization problems
Lokman, Banu; Koksalan, Murat (2019-01-01)
We develop an evolutionary algorithm for multiobjective combinatorial optimization problems. The algorithm aims at converging the preferred solutions of a decision-maker. We test the performance of the algorithm on the mul...
An interactive approximation algorithm for multi-objective integer programs
Lokman, Banu; Koksalan, Murat; Korhonen, Pekka J.; Wallenius, Jyrki (2018-08-01)
We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consiste...
Approximating the Nondominated Frontiers of Multi-Objective Combinatorial Optimization Problems
Koksalan, Murat; Lokman, Banu (2009-03-01)
Finding, all nondominated vectors for multi-objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated Frontiers of MOCO problems by fitting smooth hypersu...
Citation Formats