Cover Image

The Fair Periodic Assignment Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	van Lieshout, Rolf, van Rossum, Bart
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)

Fair Assortment Planning
by: Chen, Qinyi, et al.
Published: (2022)

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

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

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

On the Complexity of Bilevel Independent Set Problem
by: Muluk, Komal
Published: (2026)

Approximation Schemes for Sequential Hiring Problems
by: Segev, Danny, et al.
Published: (2026)

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

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

Solving the Probabilistic Profitable Tour Problem on a Tree
by: Angelelli, Enrico, et al.
Published: (2022)

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

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

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

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

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

Diversity-Fair Online Selection
by: Hu, Ming, et al.
Published: (2025)

Safe Sequences via Dominators in DAGs for Path-Covering Problems
by: Sena, Francisco, et al.
Published: (2024)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
by: Kuhlmann, Stefan, et al.
Published: (2025)

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

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
by: Gao, Xuan-Zhao, et al.
Published: (2024)

Fare Zone Assignment on Trees
by: Hoefer, Martin, et al.
Published: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)

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

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)

Robust Gittins for Stochastic Scheduling
by: Moseley, Benjamin, et al.
Published: (2025)

Is Zadeh's Least-Entered Pivot Rule Exponential?
by: Zadeh, Norman
Published: (2025)

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

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
by: Encz, Koppány István, et al.
Published: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)

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

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025)

Bayesian Optimal Stopping with Maximum Value Knowledge
by: Kleer, Pieter, et al.
Published: (2025)