The Experts below are selected from a list of 97797 Experts worldwide ranked by ideXlab platform
Ismail Hakki Toroslu - One of the best experts on this subject based on the ideXlab platform.
-
Incremental Assignment Problem
Information Sciences, 2007Co-Authors: Ismail Hakki Toroslu, Göktürk íçolukAbstract:In this paper we introduce the incremental Assignment Problem. In this Problem, a new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum-weighted matching is already known, and the maximum-weighted matching of the extended graph is sought. We propose an O(|V|^2) algorithm for the Problem.
-
personnel Assignment Problem with hierarchical ordering constraints
Computers & Industrial Engineering, 2003Co-Authors: Ismail Hakki TorosluAbstract:In the standard Assignment Problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard Assignment Problem, having some ordering constraints on the partitions of the bipartite graph. We call this Problem as 'Assignment Problem with hierarchical ordering constraint' (APHOC). As its name implies, hierarchical constraints are introduced on both partitions, and, the matching between the partitions should respect these hierarchical ordering constraints. A natural version of such constraints occurs in personnel Assignment Problem, where one of the partitions is a level graph representing the ranks of personnel, and the other one is a forest, representing the positions. We will first show that this Problem is NP-complete. Then, we will investigate some heuristic and approximate solutions. Finally, we will study the performances of these solutions.
A. Volgenant - One of the best experts on this subject based on the ideXlab platform.
-
An addendum on the incremental Assignment Problem
Information Sciences, 2008Co-Authors: A. VolgenantAbstract:In Toroslu and Ucoluk [I.H. Toroslu, G. Ucoluk, Incremental Assignment Problem, Information Sciences 177 (2007) 1523-1529] the incremental Assignment Problem is defined as follows. A new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum-weighted matching is already known, and the maximum-weighted matching of the extended graph is sought. An O(n^2) algorithm for the Problem has been derived, with n the size of a partition in the bipartite graph. We point out that such a result can be found in literature.
Michael Florian - One of the best experts on this subject based on the ideXlab platform.
-
reduced gradient algorithm for user equilibrium traffic Assignment Problem
Transportmetrica, 2020Co-Authors: Abbas Babazadeh, Babak Javani, Guido Gentile, Michael FlorianAbstract:ABSTRACTA path-based algorithm is developed for the static traffic Assignment Problem (TAP). In each iteration, it decomposes the Problem into origin-destination (OD) pairs and solves each subprobl...
Göktürk íçoluk - One of the best experts on this subject based on the ideXlab platform.
-
Incremental Assignment Problem
Information Sciences, 2007Co-Authors: Ismail Hakki Toroslu, Göktürk íçolukAbstract:In this paper we introduce the incremental Assignment Problem. In this Problem, a new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum-weighted matching is already known, and the maximum-weighted matching of the extended graph is sought. We propose an O(|V|^2) algorithm for the Problem.
David E. Boyce - One of the best experts on this subject based on the ideXlab platform.
-
ANALYTICAL MODELS OF THE DYNAMIC TRAFFIC Assignment Problem
Networks and Spatial Economics, 2001Co-Authors: David E. BoyceAbstract:A review of analytical formulations of the dynamic traffic Assignment Problem is presented, focusing on the authors' experience with variational inequality approaches. Solution algorithms and computational issues requiring additional study are discussed.
