The Day Care Assignment: A Dynamic Matching Problem
نویسندگان
چکیده
منابع مشابه
The Dynamic Assignment Problem
There has been considerable recent interest in the dynamic vehicle routing problem, but the complexities of this problem class have generally restricted research to myopic models. In this paper, we address the simpler dynamic assignment problem, where a resource (container, vehicle or driver) can only serve one task at a time. We propose a very general class of dynamic assignment models, and pr...
متن کاملThe dynamic frequency assignment problem
In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring frequency assignments need to be established throughout a deployment. The problem decomposes in three phases: assignment of an initial kernel of communications, dynamic assignment of new communication links...
متن کاملA Dynamic Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for the transport of elderly and disabled people. The focus is on a decision to make one day ahead: which requests to serve with own vehicles, and which ones to assign to subcontractors, under uncertainty of late requests which are gradually revealed during the day of operation. We call this problem the Dynamic Day-ahead Paratransit Planning problem. The d...
متن کاملSolving the Dynamic Frequency Assignment Problem
Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. For all these situations, a frequency assignment problem arises with application of specific characteristics. Different modelling ideas for every problem features, have been developed such as the handling of interference among radio s...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Economic Journal: Microeconomics
سال: 2014
ISSN: 1945-7669,1945-7685
DOI: 10.1257/mic.6.4.362