Geometry of Online Packing Linear Programs
From MaRDI portal
Publication:2843293
DOI10.1007/978-3-642-31594-7_59zbMath1272.68473arXiv1204.5810OpenAlexW2112788936MaRDI QIDQ2843293
Publication date: 12 August 2013
Published in: Mathematics of Operations Research, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.5810
Linear programming (90C05) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Secretary Markets with Local Information, Online Appointment Scheduling in the Random Order Model, Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds, A dynamic learning algorithm for online matching problems with concave returns, Primal Beats Dual on Online Packing LPs in the Random-Order Model, Competitive online algorithms for resource allocation over the positive semidefinite cone, A stochastic algorithm for online bipartite resource allocation problems, A Dynamic Near-Optimal Algorithm for Online Linear Programming, Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order, Packing returning secretaries, Simple and fast algorithm for binary integer and online linear programming, Unnamed Item, An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals, Improved Online Algorithms for Knapsack and GAP in the Random Order Model, Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints, Secretary markets with local information, Unnamed Item, Improved online algorithms for Knapsack and GAP in the random order model, Iterative computation of security strategies of matrix games with growing action set, How the Experts Algorithm Can Help Solve LPs Online, Online Submodular Maximization Problem with Vector Packing Constraint., Online generalized assignment problem with historical information
