ORL
2006
13 years 11 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
ORL
2006
13 years 11 months ago
2006
ORL
2006
13 years 11 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
ORL
2006
13 years 11 months ago
2006
We consider an M/G/1 queueing system where the speed of the server depends on the amount of work present in the system. As a service policy, we adopt the PM , release policy in a ...
ORL
2006
13 years 11 months ago
2006
We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service disc...
ORL
2006
13 years 11 months ago
2006
ORL
2006
13 years 11 months ago
2006
ORL
2006
13 years 11 months ago
2006
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
ORL
2006
13 years 11 months ago
2006
Let
ORL
2006
13 years 11 months ago
2006
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...