Expert elicitations of future energy technology costs can improve energy policy design by explicitly characterizing uncertainty. However, the recent proliferation of expert elicitation studies raises questions about the reliability and comparability of the results. In this paper, we standardize...

By its critics, the rational choice model is routinely accused of being unrealistic. One key objection has it that, for all nontrivial problems, calculating the best response is cognitively way too taxing, given the severe cognitive limitations of the human mind. If one confines the analysis to...

In 1997 two papers applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) to the p-median problem were published in consecutive volumes of the European Journal of Operational Research. Here we apply the method of HC some of the data sets which were used for computational...

Judgements and beliefs often are distorted. They are affected by underlying values and reflect strong tendencies toward wishful thinking. In action, biased thinking may or may not be detrimental, and there is a very delicate balance to keep between the need to motivate oneself for forceful...

Previous experimental investigations have shown that expectations are not perfectly rational due to bias. Traditional adaptive models, however, in many cases do not perfectly describe the formation of expectations either. This paper makes two contributions to the experimental literature on the...

Non-profit organizations like the Meals On Wheels (MOW) association of America prepare and deliver meals, typically daily, to approximately one million homebound individuals in the United States alone. However, many MOW agencies are facing a steadily increasing number of clients requesting meal...

Many practical optimization problems are dynamically changing, and require a tracking of the global optimum over time. However, tracking usually has to be quick, which excludes re-optimization from scratch every time the problem changes. Instead, it is important to make good use of the history...

The maximum clique problem (MCP) is to determine in a graph a clique (i.e., a complete subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other combinatorial problems and real-world applications. As one of the most studied NP-hard problems, many algorithms are...

Consumers tend to seek heuristic information cues to simplify the amount of information involved in tourist decisions. Accordingly, star ratings in online reviews are a critical heuristic element of the perceived evaluation of online consumer information. The objective of this article is to...