Image de couverture de livre

Polyamorous Scheduling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gąsieniec, Leszek, Smith, Benjamin, Wild, Sebastian
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Social and Information Networks Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Simple approximation algorithms for Polyamorous Scheduling
par: Biktairov, Yuriy, et autres
Publié: (2024)

Dynamic Curing and Network Design in SIS Epidemic Processes
par: Yi, Yuhao, et autres
Publié: (2022)

Robust Gittins for Stochastic Scheduling
par: Moseley, Benjamin, et autres
Publié: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
par: Ma, Zihang
Publié: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
par: Dvořák, Michal, et autres
Publié: (2026)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
par: Segev, Danny
Publié: (2024)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
par: Rohwedder, Lars, et autres
Publié: (2025)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
par: Segev, Danny
Publié: (2026)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
par: Alejandro-Soto, J. A., et autres
Publié: (2025)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2023)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
par: Segev, Danny
Publié: (2026)

Assortment optimization given basket shopping behavior using the Ising model
par: Vasilyev, Andrey, et autres
Publié: (2025)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
par: Hou, Jiaxin, et autres
Publié: (2023)

Flow Shop Scheduling with Stochastic Reentry
par: von Aspern, Maximilian, et autres
Publié: (2026)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
par: Kim, Jung-hun, et autres
Publié: (2021)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
par: Kasperski, Adam, et autres
Publié: (2024)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
par: Chen, Yike, et autres
Publié: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
par: Shi, Haoyan, et autres
Publié: (2024)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
par: Sergeev, Ivan
Publié: (2024)

Distributionally Robust Newsvendor on a Metric
par: Foussoul, Ayoub, et autres
Publié: (2024)

The Robust Bilevel Selection Problem
par: Henke, Dorothee
Publié: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
par: Ales, Zacharie, et autres
Publié: (2024)

Extracting Dual Solutions via Primal Optimizers
par: Carmon, Yair, et autres
Publié: (2024)

On the complexity of the upgrading version of the maximal covering location problem
par: Baldomero-Naranjo, Marta, et autres
Publié: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
par: Bok, Jinho, et autres
Publié: (2024)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
par: Adil, Deeksha, et autres
Publié: (2024)

Convex optimization with $p$-norm oracles
par: Adil, Deeksha, et autres
Publié: (2024)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
par: Zhang, Qiao, et autres
Publié: (2024)

Fully Subexponential Time Approximation Scheme for Product Partition
par: Costandin, Marius
Publié: (2024)

Optimization in Sanger Sequencing
par: Carpente, Luisa, et autres
Publié: (2024)

Strongly Polynomial Frame Scaling to High Precision
par: Dadush, Daniel, et autres
Publié: (2024)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
par: Sun, Shuo, et autres
Publié: (2024)

On computing approximate Lewis weights
par: Apers, Simon, et autres
Publié: (2024)

Online Matching on $3$-Uniform Hypergraphs
par: Borst, Sander, et autres
Publié: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
par: Segev, Danny
Publié: (2024)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
par: Nerem, Robert R., et autres
Publié: (2024)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
par: Housni, Omar El, et autres
Publié: (2024)

A Decomposition Theorem for Dynamic Flows
par: Graf, Lukas, et autres
Publié: (2024)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
par: Moeini, Mahdi, et autres
Publié: (2024)