The following pages link to Online algorithms: a survey (Q1403281):
Displaying 50 items.
- Competitive analysis of the online financial lease problem (Q322578) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- Scheduling light-trails on WDM rings (Q455990) (← links)
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Partial sorting problem on evolving data (Q1679242) (← links)
- A survey on risk-averse and robust revenue management (Q1694904) (← links)
- Real-time management of berth allocation with stochastic arrival and handling times (Q1707673) (← links)
- A unified framework for stochastic optimization (Q1719609) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- New results on competitive analysis of online SRPT scheduling (Q2080035) (← links)
- Online economic ordering problem for deteriorating items with limited price information (Q2084607) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Testing facility location and dynamic capacity planning for pandemics with demand uncertainty (Q2171554) (← links)
- A competitive analysis for the start-gap algorithm for online memory wear leveling (Q2224854) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← links)
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms (Q2284641) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Dynamic programming optimization in line of sight networks (Q2288208) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Firefighting on trees (Q2328866) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Analysis of seat allocation and overbooking decisions with hybrid information (Q2629656) (← links)
- An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- On Shape Optimization with Stochastic Loadings (Q2961065) (← links)
- Uncertainty feature optimization: An implicit paradigm for problems with noisy data (Q3008922) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate (Q4632204) (← links)
- Independent Sets in Restricted Line of Sight Networks (Q5056064) (← links)
- Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency (Q5106381) (← links)
- (Q5155667) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- Supply Chain Management with Online Customer Selection (Q5740223) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
