Copertina

Polyamorous Scheduling

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gąsieniec, Leszek, Smith, Benjamin, Wild, Sebastian
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Social and Information Networks Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Simple approximation algorithms for Polyamorous Scheduling
di: Biktairov, Yuriy, et al.
Pubblicazione: (2024)

Dynamic Curing and Network Design in SIS Epidemic Processes
di: Yi, Yuhao, et al.
Pubblicazione: (2022)

Robust Gittins for Stochastic Scheduling
di: Moseley, Benjamin, et al.
Pubblicazione: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
di: Ma, Zihang
Pubblicazione: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
di: Dvořák, Michal, et al.
Pubblicazione: (2026)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
di: Altschuler, Jason M., et al.
Pubblicazione: (2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
di: Segev, Danny
Pubblicazione: (2024)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
di: Rohwedder, Lars, et al.
Pubblicazione: (2025)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
di: Segev, Danny
Pubblicazione: (2026)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
di: Alejandro-Soto, J. A., et al.
Pubblicazione: (2025)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
di: Altschuler, Jason M., et al.
Pubblicazione: (2023)

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

Assortment optimization given basket shopping behavior using the Ising model
di: Vasilyev, Andrey, et al.
Pubblicazione: (2025)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
di: Hou, Jiaxin, et al.
Pubblicazione: (2023)

Flow Shop Scheduling with Stochastic Reentry
di: von Aspern, Maximilian, et al.
Pubblicazione: (2026)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
di: Kim, Jung-hun, et al.
Pubblicazione: (2021)

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

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
di: Chen, Yike, et al.
Pubblicazione: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
di: Shi, Haoyan, et al.
Pubblicazione: (2024)

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

Distributionally Robust Newsvendor on a Metric
di: Foussoul, Ayoub, et al.
Pubblicazione: (2024)

The Robust Bilevel Selection Problem
di: Henke, Dorothee
Pubblicazione: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
di: Ales, Zacharie, et al.
Pubblicazione: (2024)

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

On the complexity of the upgrading version of the maximal covering location problem
di: Baldomero-Naranjo, Marta, et al.
Pubblicazione: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
di: Bok, Jinho, et al.
Pubblicazione: (2024)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
di: Adil, Deeksha, et al.
Pubblicazione: (2024)

Convex optimization with $p$-norm oracles
di: Adil, Deeksha, 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)

Fully Subexponential Time Approximation Scheme for Product Partition
di: Costandin, Marius
Pubblicazione: (2024)

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

Strongly Polynomial Frame Scaling to High Precision
di: Dadush, Daniel, et al.
Pubblicazione: (2024)

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

On computing approximate Lewis weights
di: Apers, Simon, et al.
Pubblicazione: (2024)

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

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
di: Segev, Danny
Pubblicazione: (2024)

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

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

A Decomposition Theorem for Dynamic Flows
di: Graf, Lukas, et al.
Pubblicazione: (2024)

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