Showing 1 - 10 of 354
Persistent link: https://www.econbiz.de/10008989159
Persistent link: https://www.econbiz.de/10009583054
This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign. The complexity of the problem makes it very difficult to produce optimal solutions using standard optimization methods. We propose an...
Persistent link: https://www.econbiz.de/10014213469
Persistent link: https://www.econbiz.de/10003977186
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions. For a discrete scenario set, we fi nd that the problem is NP-hard for each of the...
Persistent link: https://www.econbiz.de/10013117811
This paper studies the robust knapsack problem, for which solutions are, up to a certain point, immune to data uncertainty. We complement the works found in the literature where uncertainty affects only the profits or only the weights of the items by studying the complexity and approximation of...
Persistent link: https://www.econbiz.de/10013117877
This note comments on a paper published by Wagner and Davis (Decision Sciences (2001), 32(4), 557–573). These authors present an integer-programming model for the single-item discrete sequential search problem with group activities. Based on their experiments, they conjecture that the problem...
Persistent link: https://www.econbiz.de/10014173171
This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n2), where n is the number of observations in a given data set. Furthermore, we prove a lower bound of (n log n) on the running time of any algorithm for testing different axioms of revealed preference
Persistent link: https://www.econbiz.de/10013105075
We consider the computational problem of testing whether observed household consumption behavior satisfies the Collective Axiom of Revealed Preferences (CARP). We propose a graph such that the existence of a node-partitioning giving rise to two induced subgraphs that are acyclic implies that the...
Persistent link: https://www.econbiz.de/10012722768
This paper presents a model for a dock assignment problem, where trailers need to be assigned to gates for a given period of time for loading or unloading activities. The parking lot is used as a buffer zone. Transportation between the parking lot and the gates is performed by additional...
Persistent link: https://www.econbiz.de/10013142584