Article references

Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

Aristide Grange, Imed Kacem, Sébastien Martin, Sarah Minich

RAIRO-Oper. Res., 57 1 (2023) 1-16

Published online: 2023-01-12

DOI: https://doi.org/10.1051/ro/2022022

This article has been cited by the following article(s):

Branch-and-bound algorithm to minimize the total completion time on two dedicated processors

Adel Kacem and Abdelaziz Dammak
Operations Research Perspectives 100391 (2026)
https://doi.org/10.1016/j.orp.2026.100391

Branch-and-Price for the Set-Union Bin Packing Problem

Julia Wahlen and Timo Gschwind
INFORMS Journal on Computing (2025)
https://doi.org/10.1287/ijoc.2024.0791

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

Gais Alhadi, Imed Kacem, Pierre Laroche and Izzeldin M. Osman
RAIRO - Operations Research 58 (3) 2393 (2024)
https://doi.org/10.1051/ro/2024029