Samuel S Chiu

• Stanford University

Viewing the future value of a cash flow stream as a polynomial in the compounding factor (being one plus the interest rate), this article uses Ruffini's rule in the synthetic division of a polynomial to provide insight linking several discounted cash flow analysis concepts. We use the polynomial remainder theorem to relate the concepts of divisor,...

This paper extends recent results on an incentive-compatible modification of the Heal algorithm for resource allocation. Previous research has shown, under some assumptions, that the participants can be induced to report the truth in their own interest so as to achieve a group optimum. Using the same modified procedure, we show that if we allow sec...

Cross-layer optimization (physical, data link and network layers) in wireless networks has been limited by its combinatorial complexity (Toumpis and Goldsmith, 2003). Existing literature has traditionally been able to provide numerical analysis only for networks with less than 8 nodes (Madan et al., 2005), limiting our ability to understand the ben...

This paper uses real option methodology to compare the cost of a long-term contract with a price cap to that of spot purchases in construction material procurement. In construction, material procurements are usually short-term, project-based and subject to high price volatility. These characteristics and the competitive nature of the industry lower...

In many location models, the customers’ choice of which facility to patronize is independent of the action of all other customers, except to the extent of capacity restrictions. We introduce a class of location problems where customers select a facility based not only on travel time or distance to the facility, but also on externalities associated...

We consider the heuristic of Sequential Location and Allocation (SLA) which is commonly used to solve location problems. Our focus is on planar and network median and center problems. We first prove that for p-median and p-center problems, the SLA heuristic can generate solutions with values as high as for the corresponding 1-median or 1-center pro...

We introduce a group of facility location problems whose objective involves both congestion and covering effects. For the Stochastic Queue Center problem, a single facility is to be located on a network to minimize expected response time (travel time plus expected queue delay) to the furthest demand point. We demonstrate certain convexity propertie...

We summarize recent results for parametric analysis of optimal facility locations and report on a number of solved and unsolved problems. We describe general conditions that yield tractable parametric analyses of location problems. We present a methodology for parametric analysis of tree network and planar location problems, as well as illustrative...

We present a survey of over 50 representative problems in location research. Our goal is not to review all variants of different location models or to describe solution results, but rather to provide a broad overview of major location problems that have been studied, indicating briefly how they are formulated and how they relate to one another. We...

In the one-median problem, a facility is to be located on a network minimizing total travel distances from the facility to customer demands restricted to nodal locations. In reality, however, demands do occur on links of a network. Thus, aggregation of or restriction to nodal demands may not be a satisfactory approximation. In this paper, we genera...

This paper provides a structure unifying several recent results on an incentive optimal resource allocation problem. They include an incentive-compatible modification of the Heal Algorithm, a generalization of it allowing the formation of secret coalitions and a class of center-free resource allocation algorithms as special cases. Our framework enc...

This paper represents two major extensions of Hakimi's one-median problem specialized on a tree network T:(i) queueing delay is explicitly included in the objective function, and (ii) probabilistic demands for service can originate continuously along a link as well as discretely at a node. Calls for service occur as a time-homogeneous Poisson proce...

We consider a demand-responsive service system in which n mobile units (servers) are garaged at one facility. Service demands arrive in time as a homogenous Poisson process, but are located over the service region according to an arbitrary probability law. Given a random service demand, either (1) a mobile unit is dispatched to the demand's locatio...

This paper extends recent work on finding the stochastic queue median (SQM) on a network. The SQM is the optimal location of a single mobile server, when idle, who travels to customers in response to requests for service. Customer demands are limited to the nodes of the network and their requests for service arrive according to a time homogeneous P...

The Bertrand paradox question is: "Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a 'random' chord of a unit-radius circle has length greater than 3 ." Bertrand derived three different 'correct' answers, the correctness depending on interpreta...

Submitted to the Department of Management Science and Engineering. Copyright by the author. Thesis (Ph. D.)--Stanford University, 2003.