Narrow search
Showing 1 - 10 of 788
Cover Image
Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
Liu, Ming; Zheng, Feifeng; Zhu, Zhanguo; Chu, Chengbin - In: Asia-Pacific Journal of Operational Research (APJOR) 31 (2014) 05, pp. 1450038-1
processing times. We mainly propose an optimal ϕ-competitive online algorithm where ϕ ≥ 1 is a solution of equation ϕ3 + (α-1)ϕ2 …
Persistent link: https://www.econbiz.de/10011010797
Cover Image
A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES
JIAO, CHENGWEN; LI, WENHUA; YUAN, JINJIANG - In: Asia-Pacific Journal of Operational Research (APJOR) 31 (2014) 04, pp. 1450030-1
, that is b < ∞. In this paper, we provide a best possible online algorithm for the problem with a competitive ratio of …
Persistent link: https://www.econbiz.de/10011010805
Cover Image
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem
Yu, Wei; Liu, Zhaohui; Bao, Xiaoguang - In: European Journal of Operational Research 238 (2014) 3, pp. 735-740
This paper is concerned with the Online Quota Traveling Salesman Problem. Depending on the symmetry of the metric and the requirement for the salesman to return to the origin, four variants are analyzed. We present optimal deterministic algorithms for each variant defined on a general space, a...
Persistent link: https://www.econbiz.de/10010785317
Cover Image
Single machine scheduling with release dates
GOEMANS, Michel; QUEYRANNE, Maurice; SCHULZ, Andreas; … - Center for Operations Research and Econometrics (CORE), … - 1999
, the other on a completion-time formulation. We show their equivalence by proving that a O(n log n) greedy algorithm leads …
Persistent link: https://www.econbiz.de/10005065311
Cover Image
ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
HE, YONG; HAN, SHUGUANG; JIANG, YIWEI - In: Asia-Pacific Journal of Operational Research (APJOR) 24 (2007) 02, pp. 263-277
initially activated, and when a job is revealed the algorithm has the option to activate new machines. The objective is to … competitive ratios of 3/2 and 5/3 for m = 2, 3 cases, respectively. Then we present an online algorithm with a competitive ratio …
Persistent link: https://www.econbiz.de/10005047159
Cover Image
The Steiner Traveling Salesman Problem with online edge blockages
Zhang, Huili; Tong, Weitian; Xu, Yinfeng; Lin, Guohui - In: European Journal of Operational Research 243 (2015) 1, pp. 30-40
first show a lower bound on the competitive ratio and present an online optimal algorithm for the problem. While this … optimal algorithm has non-polynomial running time, we present another online polynomial-time near optimal algorithm for the … problem. Experimental results show that our online polynomial-time algorithm produces solutions very close to the offline …
Persistent link: https://www.econbiz.de/10011190815
Cover Image
Double Marginalization in Performance-Based Advertising: Implications and Solutions
Dellarocas, Chrysanthos - In: Management Science 58 (2012) 6, pp. 1178-1195
An important current trend in advertising is the replacement of traditional pay-per-exposure (pay-per-impression) pricing models with performance-based mechanisms in which advertisers pay only for measurable actions by consumers. Such pay-per-action (PPA) mechanisms are becoming the predominant...
Persistent link: https://www.econbiz.de/10010990608
Cover Image
"To Sponsor or not to Sponsor: Sponsored Search Auctions with Organic Links"
Arnold, Michael; Darmon, Eric; Penard, Thierry - Department of Economics, Lerner College of Business and … - 2012
search engine algorithm) may lead to either more or less aggressive bidding for sponsored link positions depending on …
Persistent link: https://www.econbiz.de/10009652267
Cover Image
Bayes–Nash equilibria of the generalized second-price auction
Gomes, Renato; Sweeney, Kane - In: Games and Economic Behavior 86 (2014) C, pp. 421-437
We develop a Bayes–Nash analysis of the generalized second-price (GSP) auction, the multi-unit auction used by search engines to sell sponsored advertising positions. Our main result characterizes the efficient Bayes–Nash equilibrium of the GSP and provides a necessary and sufficient...
Persistent link: https://www.econbiz.de/10010785200
Cover Image
Dynamic Cost-Per-Action Mechanisms and Applications to Online Advertising
Nazerzadeh, Hamid; Saberi, Amin; Vohra, Rakesh - Center for Mathematical Studies in Economics and … - 2007
describe a mechanism based on a sampling-based learning algorithm that under suitable assumptions is asymptotically …
Persistent link: https://www.econbiz.de/10005824561