Pages that link to "Item:Q1048670"
From MaRDI portal
The following pages link to Online algorithms. The state of the art (Q1048670):
Displaying 50 items.
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- Time traps in supply chains: is optimal still good enough? (Q1681387) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Algorithms for on-line order batching in an order picking warehouse (Q1761193) (← links)
- On-line vertex-covering (Q1770381) (← links)
- Online matching on a line (Q1770389) (← links)
- Batched bin packing (Q1779689) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- On list update and work function algorithms. (Q1853486) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- Online variable sized covering (Q1854485) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022) (← links)
- Scheduling broadcasts with deadlines (Q1884847) (← links)
- Competitive analysis of incentive compatible on-line auctions (Q1884971) (← links)
- A note on on-line scheduling with partial information (Q1886493) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- New results for online page replication (Q1887086) (← links)
- Competitive caching of query results in search engines (Q1887088) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- A risk-reward model for the on-line leasing of depreciable equipment (Q1944085) (← links)
- Ronald Graham: laying the foundations of online optimization (Q1946024) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Progressive learning: a deep learning framework for continual learning (Q1982451) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- A new model for the linear 1-dimensional online clustering problem (Q2254541) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Online coloring a token graph (Q2303438) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Energy-optimal broadcast and exploration in a tree using mobile agents (Q2330122) (← links)
- The online \(k\)-server problem with rejection (Q2339820) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Learning lexicographic orders (Q2371364) (← links)
- Strongly competitive algorithms for caching with pipelined prefetching (Q2390276) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- Strategies for dispatching AGVs at automated seaport container terminals (Q2432107) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)