In this paper, we consider a new customer choice model which we call the single transition choice model. In this model, there is a universe of products and customers arrive at each product with a certain probability. If the arrived product is unavailable, then the seller can recommend a subset...

We study the computational complexity of the discrete sequential search problem with group activities, in which a set of boxes and group activities is given, and a single object is hidden in one of these boxes. The goal is to find a sequence in which the boxes are to be searched and the group...

A k-out-of-n system configuration requires that, for the overall system to be functional, at least k out of the total of n components must be working. This paper addresses the search for a least-cost diagnosis strategy for k-out-of-n systems when the individual component tests are imperfect,...

We study a single-machine scheduling problem that is a generalization of a number of problems for which computational procedures have already been published. Each job has a processing time, a release date, a due date, a deadline and a weight representing the penalty per unit-time delay beyond...

This paper focuses on revealed preference tests of the collective model of household consumption. We start by showing that the decision problems corresponding to testing collective rationality are NP-complete. This makes the application of these tests problematic for (increasingly available)...

In this work, we study the assortment planning games in which multiple retailers interact in the market. Each retailer owns some of the products and their goal is to select a subset of products, i.e., an assortment to o er to the customers so as to maximize their expected revenue. The purchase...

{Problem Definition:} This paper considers the operational management problems under a newly proposed choice model that captures the effect of focality. The offered assortment is separated into the focal set and the non-focal set under this new model due to the bias of focality, which is...

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively...