Pickup and delivery problems (PDP), where locations may both receive and send goods, are an extension of the classical vehicle routing problem. This paper considers the application of a routing and scheduling problem for forwarding agencies handling less-than-truckload freight in disasters. The...

We study the problem of how to allocate a set of indivisible objects like jobs or houses and an amount of money among a group of people as fairly and as efficiently as possible. A particular constraint for such an allocation is that every person should be assigned with the same number of objects...

We introduce a general competitive exchange economy with indivisible goods and money. There are finitely many agents and finitely many indivisible goods. Each agent is initially endowed with several units of each indivisible good and certain amount of money. Money is treated as a perfectly...

One set of n objects of type I, another set of n objects of type II, and an amount M of money is to be completely allocated among n agents in such a way that each agent gets one object of each type with some amount of money. We propose a new solution concept to this problem called a perfectly...

This paper considers how best to sequence the acquisition of new locations (e.g. office park buildings, multi-tenant units, etc.) to expand the coverage area or fill in the geographic footprint of a network service provider or other business-service activities. Consider several locations,...

In this paper we consider a firm that employs heterogeneous workers to meet demand for its product or service. Workers differ in their skills, speed, and/or quality, and they randomly leave, or turn over. Each period the firm must decide how many workers of each type to hire or fire in order to...