2 citations · 3 across the 8 of their papers we have counts for
10 papers
A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment
Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Sadok Ben Yahia +1
This paper presents a new simulation-based approach to address the stochastic Dynamic Traffic Assignment (DTA) problem, focusing on large congested networks and dynamic settings. T…
Real-Time Calibration of Disaggregated Traffic Demand
Mozhgan Pourmoradnasseri, Kaveh Khoshkhah, Amnir Hadachi
This paper presents a simulation-based optimization framework for city-scale real-time estimation and calibration of dynamic demand models by focusing on disaggregated microsimulat…
Weighted Upper Edge Cover: Complexity and Approximability
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jerome Monnot +1
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum m…
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn +1
We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hy…
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
Kaveh Khoshkhah, Dirk Oliver Theis
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum S…
Fooling Sets and the Spanning Tree Polytope
Kaveh Khoshkhah, Dirk Oliver Theis
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum S…
On finding orientations with fewest number of vartices with small out-degree
Kaveh Khoshkhah
Given an undirected graph, each of the two end-vertices of an edge can own the edge. Call a vertex poor, if it owns at most one edge. We give a polynomial time algorithm for the pr…
On the largest dynamic monopolies of graphs with a given average threshold
Kaveh Khoshkhah, Manouchehr Zaker
Let be a graph and be an assignment of nonnegative integer thresholds to the vertices of . A subset of vertices is said to be a -dynamic monopoly, if can b…
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
Let be a directed graph such that the in-degree of any vertex is at least one. Let also be an assignment of thresholds to the vertice…
On dynamic monopolies of graphs: the average and strict majority thresholds
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
Let be a graph and be an assignment of thresholds to the vertices of . A subset of vertices is said to be a dynamic mono…