Search Results - "KÖKSALAN, Murat"

Finding the Nondominated Set and Efficient Integer Vectors for a Class of Three-Objective Mixed-Integer Linear Programs by Ceyhan, Gökhan, Köksalan, Murat, Lokman, Banu

“…We consider a class of three-objective mixed-integer linear programs (MILPs) where at least one of the objective functions takes only discrete values. These…”
Get full text

Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently by Ceyhan, Gökhan, Köksalan, Murat, Lokman, Banu

“…•There may not exist uniform prices in day-ahead electricity markets.•Market operators aim for partial-equilibrium solutions.•Pricing variables are associated…”
Get full text

A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem by Dasdemir, Erdi, Köksalan, Murat, Tezcaner Öztürk, Diclehan

“…•We develop a preference-based MOEA to converge to reference points.•The decision maker may change reference points throughout the algorithm.•The algorithm…”
Get full text

Finding all nondominated points of multi-objective integer programs by Lokman, Banu, Köksalan, Murat

“…We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the…”
Get full text

Finding a representative nondominated set for multi-objective mixed integer programs by Ceyhan, Gökhan, Köksalan, Murat, Lokman, Banu

“…•Representative sets are found for multi-objective mixed integer programs.•A desired level of quality is guaranteed in representing the nondominated…”
Get full text

Representing the nondominated set in multi-objective mixed-integer programs by Doğan, Ilgın, Lokman, Banu, Köksalan, Murat

“…•An exact algorithm is developed for multi-objective mixed integer programs.•Small representative sets guaranteeing a prespecified precision are…”
Get full text

UAV routing for reconnaissance mission: A multi-objective orienteering problem with time-dependent prizes and multiple connections by Dasdemir, Erdi, Batta, Rajan, Köksalan, Murat, Tezcaner Öztürk, Diclehan

“…We address the route planning problem of an unmanned air vehicle (UAV) tasked with collecting information from a radar-monitored environment for a…”
Get full text

Biobjective route planning of an unmanned air vehicle in continuous space by Tezcaner Öztürk, Diclehan, Köksalan, Murat

“…•Finds all efficient routes of an UAV considering distance and threat objectives.•The UAV can move to any point in the continuous space.•Characterizes…”
Get full text

Estimating the form of a decision maker’s preference function and converging towards preferred solutions by Karakaya, Gülşah, Köksalan, Murat

“…Preference functions have been widely used to scalarize multiple objectives. Various forms such as linear, quasiconcave, or general monotone have been assumed…”
Get full text

An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs by Ozpeynirci, Ozgur, Koksalan, Murat

“…In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a…”
Get full text

Distribution based representative sets for multi-objective integer programs by Özarık, Sami Serkan, Lokman, Banu, Köksalan, Murat

“…•A density measure is introduced to study the characteristics of nondominated sets.•Distribution based representations are found for Multi-Objective Integer…”
Get full text

An interactive approach to stochastic programming-based portfolio optimization by Koksalan, Murat, Sakar, Ceren Tuncer

“…We consider expected return, Conditional Value at Risk, and liquidity criteria in a multi-period portfolio optimization setting modeled by stochastic…”
Get full text

Biobjective UAV routing for a mission to visit multiple mobile targets by Karabay, Nail, Köksalan, Murat, Tezcaner Öztürk, Diclehan

“…We address the route planning problem of an unmanned air vehicle (UAV) that operates in a two-dimensional hostile terrain monitored with radars. In this…”
Get full text

Finding nadir points in multi-objective integer programs by Köksalan, Murat, Lokman, Banu

“…We address the problem of finding the nadir point in a multi-objective integer programming problem. Finding the nadir point is not straightforward, especially…”
Get full text

An interactive approach to multicriteria sorting for quasiconcave value functions by Ulu, Canan, Köksalan, Murat

“…In this article, we develop an interactive algorithm to place alternatives in ordered preference classes for a decision maker (DM) with an increasing…”
Get full text

An interactive approximation algorithm for multi-objective integer programs by Lokman, Banu, Köksalan, Murat, Korhonen, Pekka J., Wallenius, Jyrki

“…•An interactive algorithm for multi-objective integer programs is developed.•The algorithm finds the most preferred point at a desired level of accuracy.•The…”
Get full text

A multi-objective multi-period stochastic programming model for public debt management by Balibek, Emre, Köksalan, Murat

“…While raising debt on behalf of the government, public debt managers need to consider several possibly conflicting objectives and have to find an appropriate…”
Get full text

Interactive approaches for biobjective problems with progressively changing solution sets by Karakaya, Gülşah, Köksalan, Murat

“…In this study, we develop interactive approaches to find a satisfactory alternative of a decision maker (DM) having a quasiconvex preference function where the…”
Get full text

An interactive algorithm to find the most preferred solution of multi-objective integer programs by Lokman, Banu, Köksalan, Murat, Korhonen, Pekka J., Wallenius, Jyrki

“…In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming…”
Get full text

An evolutionary approach to generalized biobjective traveling salesperson problem by Köksalan, Murat, Tezcaner Öztürk, Diclehan

“…We consider the generalized biobjective traveling salesperson problem, where there are a number of nodes to be visited and each node pair is connected by a set…”
Get full text