Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
Cardinality-constrained continuous knapsack problem with concave piecewise-linear utilities
Carlos Cardonha, Miao Bai
University of Connecticut, School of Business, United States of America
We study an extension of the cardinality-constrained knapsack problem where each item has a concave piecewise-linear utility structure. For the offline problem, we present a fully polynomial-time approximation scheme and show that it can be cast as the maximization of a submodular function with cardinality constraints; the latter result allows us to derive a greedy (1 − 1/e)-approximation algorithm. For the online problem in the random order model, we present a 6.027-competitive algorithm.
Revenue management under a price alert mechanism
Nanxi Zhang1, Jiang Bo1, Zizhuo Wang2
1Shanghai University of Finance and Economics; 2Chinese University of Hongkong, Shenzhen
TBD
Fluid approximations for revenue management under high-variance demand
Huseyin Topaloglu, Yicheng Bai, Omar El Housni, Billy Jin
