Cover Image

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baxi, Saumil, Cummings, Kayla, Jacquillat, Alexandre, Lo, Sean, McDonald, Rob, Mellou, Konstantina, Menache, Ishai, Molinaro, Marco
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Data Structures and Algorithms 90C11
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Power of Migrations in Dynamic Bin Packing
by: Mellou, Konstantina, et al.
Published: (2024)

Subpath-Based Column Generation for Electric Vehicle Routing Problems
by: Jacquillat, Alexandre, et al.
Published: (2024)

Large Language Models for Supply Chain Decisions
by: Simchi-Levi, David, et al.
Published: (2025)

OptiMind: Teaching LLMs to Think Like Optimization Experts
by: Zhang, Xinzhi, et al.
Published: (2025)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
by: Kesselheim, Thomas, et al.
Published: (2025)

Online Scheduling for LLM Inference with KV Cache Constraints
by: Jaillet, Patrick, et al.
Published: (2025)

Optimizing Inventory Placement for a Downstream Online Matching Problem
by: Epstein, Boris, et al.
Published: (2024)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
by: da Silva, Renan F. F., et al.
Published: (2026)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)

On the Adversarial Robustness of Online Importance Sampling
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
by: Vakhania, Nodari, et al.
Published: (2024)

Online Sampling and Decision Making with Low Entropy
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2021)

Implicit Decision Diagrams
by: Rudich, Isaac, et al.
Published: (2026)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
by: Ardizzoni, Stefano, et al.
Published: (2021)

An efficient recursive decomposition algorithm for undirected graphs
by: Heng, Pei, et al.
Published: (2026)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)

Sample-efficient Multiclass Calibration under $\ell_{p}$ Error
by: Bairaktari, Konstantina, et al.
Published: (2025)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
by: Ozturk, Berk, et al.
Published: (2025)

Column-generation for a two-dimensional multi-criteria bin-packing problem
by: Groschke, Christof, et al.
Published: (2025)

An online joint replenishment problem combined with single machine scheduling
by: Györgyi, Péter, et al.
Published: (2022)

Coach Reservation for Groups Requests
by: Cardonha, Carlos H., et al.
Published: (2024)

A Double Decomposition Algorithm for Network Planning and Operations in Deviated Fixed-route Microtransit
by: Martin-Iradi, Bernardo, et al.
Published: (2024)

Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
by: Nikolov, Aleksandar, et al.
Published: (2026)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
by: Braverman, Mark, et al.
Published: (2024)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

Learning to Cover: Online Learning and Optimization with Irreversible Decisions
by: Jacquillat, Alexandre, et al.
Published: (2024)

Centrality measures and opinion dynamics in two-layer networks with replica nodes
by: Zhao, Chi, et al.
Published: (2024)

Thompson Sampling Itself is Differentially Private
by: Ou, Tingting, et al.
Published: (2024)

Online Matching Meets Sampling Without Replacement
by: Huang, Zhiyi, et al.
Published: (2024)

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

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
by: Li, Yingxi, et al.
Published: (2025)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

Supermodular Approximation of Norms and Applications
by: Kesselheim, Thomas, et al.
Published: (2024)

A Learning Perspective on Random-Order Covering Problems
by: Gupta, Anupam, et al.
Published: (2025)