Partitioning problems with splittings and interval targets

DOI10.4230/LIPICS.ISAAC.2024.12MaRDI QIDQ7260622zbMATH OpenFDO

Authors Samuel Bismuth, Vladislav Makarov, Erel Segal-Halevi, Dana Shapira

Publication date 8 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2024.12

zbMATH Keywords

fair divisionidentical machine schedulingnumber partitioning

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Complexity of fragmentable object bin packing and an application
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Efficient Fair Division with Minimal Sharing
• Fair division of mixed divisible and indivisible goods
• Fair division with bounded sharing: binary and non-degenerate valuations
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• scientific article; zbMATH DE number 1830744 (Why is no real title available?)
• Integer optimization with penalized fractional values: the knapsack case
• Parallel machine scheduling with splitting jobs
• Scheduling with deadlines and loss functions
• The multiple subset sum problem
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: Partitioning problems with splittings and interval targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260622)