Copertina

Competitive Online Optimization under Inventory Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lin, Qiulin, Yi, Hanling, Pang, John, Chen, Minghua, Wierman, Adam, Honig, Michael, Xiao, Yuanzhang
Natura:	Preprint
Pubblicazione:	2019
Soggetti:	Performance Data Structures and Algorithms Systems and Control Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimal Decentralized Smoothed Online Convex Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2024)

On the Fair Comparison of Optimization Algorithms in Different Machines
di: Arza, Etor, et al.
Pubblicazione: (2023)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
di: Zhai, Jianing, et al.
Pubblicazione: (2019)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2023)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
di: Brubaker, Kyle, et al.
Pubblicazione: (2025)

SCaLE: Switching Cost aware Learning and Exploration
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2026)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
di: Sun, Shuo, et al.
Pubblicazione: (2024)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
di: Zhang, Qiao, et al.
Pubblicazione: (2024)

Online Matching on $3$-Uniform Hypergraphs
di: Borst, Sander, et al.
Pubblicazione: (2024)

Online Decision Making with Fairness over Time
di: Chen, Rui, et al.
Pubblicazione: (2022)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
di: Bhimaraju, Akhil, et al.
Pubblicazione: (2023)

Solving Linear Programs with Fast Online Learning Algorithms
di: Gao, Wenzhi, et al.
Pubblicazione: (2021)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
di: Chen, Shengminjie, et al.
Pubblicazione: (2023)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
di: Xu, Pan
Pubblicazione: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
di: Chen, Shengminjie, et al.
Pubblicazione: (2026)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
di: Kasperski, Adam, et al.
Pubblicazione: (2024)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
di: Shen, Owen, et al.
Pubblicazione: (2026)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
di: Jin, Billy, et al.
Pubblicazione: (2022)

Optimization in Sanger Sequencing
di: Carpente, Luisa, et al.
Pubblicazione: (2024)

Submodular Order Functions and Assortment Optimization
di: Udwani, Rajan
Pubblicazione: (2021)

Extracting Dual Solutions via Primal Optimizers
di: Carmon, Yair, et al.
Pubblicazione: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
di: Marsden, Annie, et al.
Pubblicazione: (2025)

Quasi-Self-Concordant Optimization with Lewis Weights
di: Ene, Alina, et al.
Pubblicazione: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
di: Adil, Deeksha, et al.
Pubblicazione: (2025)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
di: Chang, Claire, et al.
Pubblicazione: (2026)

Optimized methods for composite optimization: a reduction perspective
di: Bok, Jinho, et al.
Pubblicazione: (2025)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
di: Nerem, Robert R., et al.
Pubblicazione: (2024)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
di: Chen, Li, et al.
Pubblicazione: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
di: Housni, Omar El, et al.
Pubblicazione: (2024)

When Location Shapes Choice: Placement Optimization of Substitutable Products
di: Housni, Omar El, et al.
Pubblicazione: (2023)

Parameterized algorithms for block-structured integer programs with large entries
di: Cslovjecsek, Jana, et al.
Pubblicazione: (2023)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
di: Yamanaka, Toshiaki
Pubblicazione: (2025)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

Online Stochastic Packing with General Correlations
di: Cetin, Sabri, et al.
Pubblicazione: (2025)

A Control-Theoretic Perspective on Optimal High-Order Optimization
di: Lin, Tianyi, et al.
Pubblicazione: (2019)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
di: Shah, Harsh, et al.
Pubblicazione: (2025)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)