arXiv (All)
open access
Online Linear Programming with Batching
We study Online Linear Programming (OLP) with batching. The planning horizon is cut into $K$ batches, and decisions on orders can be delayed to the end of their associated batch. The ability to delay decisions improves operational performance, as measured by regret. We study two questions: (1) What
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Better Late Than Never: Online Flow Time Scheduling with Online Estimates#984328
- Learning When to Update: A Near-Optimal Timing Bandit Approach#1142237
- Learning When to Update: A Near-Optimal Timing Bandit Approach#1122317
- Leveraging I/O Stalls for Efficient Scheduling in ANNS#204867
- Pacing Equilibria in Abstract Mechanisms#1063496
Record · ID 1200728
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive