The following pages link to (Q4230356):
Displaying 22 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Average-case competitive analyses for one-way trading (Q626450) (← links)
- Competitive algorithms for unbounded one-way trading (Q897958) (← links)
- Competitive analysis of the online inventory problem (Q992666) (← links)
- Online search with time-varying price bounds (Q1031868) (← links)
- An improvement on El-Yaniv-Fiat-Karp-Turpin's money-making bi-directional trading strategy (Q1129108) (← links)
- Competitive analysis of bi-directional non-preemptive conversion (Q1679505) (← links)
- On-line vertex-covering (Q1770381) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- Competitive analysis of incentive compatible on-line auctions (Q1884971) (← links)
- Strategies for maximizing seller's profit under unknown buyer's valuations (Q1977848) (← links)
- Competitive difference analysis of the cash management problem with uncertain demands (Q2294663) (← links)
- How much is it worth to know the future in online conversion problems? (Q2446338) (← links)
- Optimal online \(k\)-min search (Q2516358) (← links)
- Constant competitive algorithms for unbounded one-way trading under monotone hazard rate (Q2668551) (← links)
- Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
- Price Fluctuations: To Buy or to Rent (Q3558910) (← links)
- Empirical Analysis of an Online Algorithm for Multiple Trading Problems (Q3627706) (← links)
- On-line resource management with applications to routing and scheduling (Q4645187) (← links)
- Serving requests with on-line routing (Q5056164) (← links)
- Competitive algorithms for the on-line traveling salesman (Q5057434) (← links)
- Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices (Q5242357) (← links)
