Finding All Maximal Paths In Web User Sessions

Finding all nondominated points of multi-objective integer programs LOKMAN, BANU; Köksalan, Mustafa Murat (2013-10-01) We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with additional binary variables and constraints. The other algorithm employs a search procedure and solves a number of models to find the next point avoiding any additional binary variables. Both algorithms guarantee to find a...
Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs Karakaya, Gülşah; Köksalan, M. (2023-07-01) Many interactive approaches in multi-objective optimization assume the existence of an underlying preference function that represents the preferences of a decision maker (DM). In this paper, we develop the theory and an exact algorithm that guarantees finding the most preferred solution of a DM whose preferences are consistent with a Tchebycheff function for multi-objective integer programs. The algorithm occasionally presents pairs of solutions to the DM and asks which one is preferred. It utilizes the pre...
Finding nadir points in multi-objective integer programs Köksalan, Mustafa Murat; LOKMAN, BANU (Springer Science and Business Media LLC, 2015-05-01) Let H be a subgroup of a finite group G, and suppose that H contains a Sylow p-subgroup P of G. Write N=NG(H)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N = \mathbf{N}_{G}(H)$$\end{document}, and assume that the Sylow p-subgroups of H boolean AND Hg\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usep...
Finding highly preferred points for multi-objective integer programs LOKMAN, BANU; Köksalan, Mustafa Murat (Informa UK Limited, 2014-01-01) 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 too many non-dominated points in large MOIPs and it is not practical to generate them all. Therefore, the problem of generating non-dominated points in the preferred region of the decision-maker is addressed. To define the preferred region, the non-dominated set is approximated using a hyper-surface. A procedure is developed...
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 representations of the sets by a Tchebycheff distance-based coverage gap measure. The first algorithm aims to substantially improve the computational efficiency of an existing algorithm that is designed to continue generating new points until the decision maker (DM) finds the generated set sat...

Citation Formats

M. A. BAYIR and İ. H. Toroslu, “Finding All Maximal Paths In Web User Sessions,” 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/69426.