Online algorithms: a survey
From MaRDI portal
Publication:1403281
DOI10.1007/s10107-003-0436-0zbMath1035.68136MaRDI QIDQ1403281
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0436-0
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68W25: Approximation algorithms
Related Items
A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate, Unnamed Item, Independent Sets in Restricted Line of Sight Networks, Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency, Measuring the problem-relevant information in input, Unnamed Item, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Supply Chain Management with Online Customer Selection, Adaptive Bin Packing with Overflow, Replenishment Policy with Limited Price Information, An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller, Literature reviews in operations research: a new taxonomy and a meta review, Competitive analysis of the online financial lease problem, Connectivity games over dynamic networks, Scheduling light-trails on WDM rings, The optimal structure of algorithms for \(\alpha\)-paging, A theoretical comparison of LRU and LRU-K, Scheduling unit length jobs on parallel machines with lookahead information, Improved bounds for online scheduling with eligibility constraints, On-line scheduling mesh jobs with dependencies, The beachcombers' problem: walking and searching with mobile robots, Online scheduling of parallel jobs on two machines is 2-competitive, Clever or smart: strategies for the online target date assignment problem, A survey on metaheuristics for stochastic combinatorial optimization, Partial sorting problem on evolving data, A survey on risk-averse and robust revenue management, Real-time management of berth allocation with stochastic arrival and handling times, A unified framework for stochastic optimization, Offline file assignments for online load balancing, Prior-free online mechanisms for queueing with arrivals, A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model, New results on competitive analysis of online SRPT scheduling, Online economic ordering problem for deteriorating items with limited price information, Scheduling with a processing time oracle, Testing facility location and dynamic capacity planning for pandemics with demand uncertainty, A competitive analysis for the start-gap algorithm for online memory wear leveling, Online failure diagnosis in interdependent networks, Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms, Beachcombing on strips and islands, Dynamic programming optimization in line of sight networks, Algorithm for online 3-path vertex cover, Firefighting on trees, \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm, Approximation and online algorithms for multidimensional bin packing: a survey, Improved analysis of the online set cover problem with advice, The online knapsack problem: advice and randomization, Analysis of seat allocation and overbooking decisions with hybrid information, An online optimization approach for post-disaster relief distribution with online blocked edges, A Survey of Algorithms and Models for List Update, A survey on combinatorial optimization in dynamic environments, Advice complexity of disjoint path allocation, On Shape Optimization with Stochastic Loadings, Uncertainty feature optimization: An implicit paradigm for problems with noisy data, Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures, From Cost Sharing Mechanisms to Online Selection Problems
