Sciweavers

41 search results - page 5 / 9
» A Knapsack Secretary Problem with Applications
Sort
View
94
Voted
IOR
2008
105views more  IOR 2008»
14 years 9 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao
CEC
2008
IEEE
15 years 4 months ago
Methods for decreasing the number of objective evaluations for independent computationally expensive objective problems
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
Greg Rohling
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
15 years 2 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 2 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
108
Voted
4OR
2008
115views more  4OR 2008»
14 years 8 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...