Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Manshadi, Vahideh H."'
Autor:
Galle, Virgile, Boroujeni, Setareh Borjian, Manshadi, Vahideh H., Barnhart, Cynthia, Jaillet, Patrick
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. However, the assumption of kno
Externí odkaz:
http://arxiv.org/abs/1703.04769
Autor:
Manshadi, Vahideh H., Misra, Sidhant
Many products and innovations become well-known and widely adopted through the social interactions of individuals in a population. The Bass diffusion model has been widely used to model the temporal evolution of adoption in such social systems. In th
Externí odkaz:
http://arxiv.org/abs/1606.03386
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers respecting a given order of retrieval. While the problem is known to be NP-h
Externí odkaz:
http://arxiv.org/abs/1505.04229
We introduce a new model and mathematical formulation for planning crane moves in the storage yard of container terminals. Our objective is to develop a tool that captures customer centric elements, especially service time, and helps operators to man
Externí odkaz:
http://arxiv.org/abs/1503.01535
Current kidney exchange pools are of moderate size and thin, as they consist of many highly sensitized patients. Creating a thicker pool can be done by waiting for many pairs to arrive. We analyze a simple class of matching algorithms that search per
Externí odkaz:
http://arxiv.org/abs/1301.3509
Autor:
Manshadi, Vahideh H., Saberi, Amin
We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds on an individual choosing whether to cooperate or defect in a repeated game. The players revise their a
Externí odkaz:
http://arxiv.org/abs/1102.1038
We consider the online stochastic matching problem proposed by Feldman et al. [FMMM09] as a model of display ad allocation. We are given a bipartite graph; one side of the graph corresponds to a fixed set of bins and the other side represents the set
Externí odkaz:
http://arxiv.org/abs/1007.1673
Publikováno v:
Mathematics of Operations Research, 2012 Nov 01. 37(4), 559-573.
Externí odkaz:
http://dx.doi.org/10.1287/moor.1120.0551
Autor:
Manshadi, Vahideh H., Saberi, Amin
Publikováno v:
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference; Jan2012, p227-235, 9p
Publikováno v:
2012 Proceedings IEEE INFOCOM; 1/ 1/2012, p810-818, 9p