EOR
2008
13 years 5 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
EOR
2008
13 years 5 months ago
2008
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
EOR
2008
13 years 5 months ago
2008
We study a problem faced by a major beverage producer. The company produces and distributes several brands to various customers from its regional distributors. For some of these b...
EOR
2008
13 years 5 months ago
2008
This paper describes potential applications of multi-attribute preference models (MAPM) in e-commerce and offers some guidelines for their implementation. MAPM are methodologies f...
EOR
2008
13 years 5 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
EOR
2008
13 years 5 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
EOR
2008
13 years 5 months ago
2008
EOR
2008
13 years 5 months ago
2008
We solve an optimal growth model in continuous space, continuous and bounded time. The optimizer chooses the optimal trajectories of capital and consumption across space and time ...
EOR
2008
13 years 5 months ago
2008
In this paper we prove the existence and uniqueness of a solution concept for n-person games with fuzzy coalitions, which we call the Shapley mapping. The Shapley mapping, when it...