Pages that link to "Item:Q1031868"
From MaRDI portal
The following pages link to Online search with time-varying price bounds (Q1031868):
Displaying 17 items.
- Competitive difference analysis of the one-way trading problem with limited information (Q322991) (← links)
- Optimal algorithms for online time series search and one-way trading with interrelated prices (Q421255) (← links)
- Online \((J, K)\)-search problem and its competitive analysis (Q501005) (← links)
- Optimal algorithms for the online time series search problem (Q621833) (← links)
- Competitive analysis of online inventory problem with interrelated prices (Q681043) (← links)
- Competitive analysis of price online inventory problem with cost function (Q1650712) (← links)
- Competitive analysis of bi-directional non-preemptive conversion (Q1679505) (← links)
- Optimal replenishment under price uncertainty (Q1698891) (← links)
- Online algorithms for the multiple time series search problem (Q1762061) (← links)
- Online algorithms for the general \(k\)-search problem (Q1944112) (← links)
- An online trading problem with an increasing number of available products (Q2168746) (← links)
- How much is it worth to know the future in online conversion problems? (Q2446338) (← links)
- Optimal online \(k\)-min search (Q2516358) (← links)
- Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
- Online Two Stage <i>k</i>-Search Problem and Its Competitive Analysis (Q5298306) (← links)
- COMPETITIVE ANALYSIS OF INTERRELATED PRICE ONLINE INVENTORY PROBLEMS WITH DEMANDS (Q5370792) (← links)
- Optimal online two-way trading with bounded number of transactions (Q5919673) (← links)