Exact algorithms for allocation problems

DOI10.1007/978-3-319-78455-7_19MaRDI QIDQ777301zbMATH OpenOpenAlexFDO

Authors Sundar Annamalai, N. S. Narayanaswamy

Publication date 7 July 2020

Full work available at URL https://doi.org/10.1007/978-3-319-78455-7_19

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Bounding the running time of algorithms for scheduling and packing problems
• Bounding the running time of algorithms for scheduling and packing problems
• On the optimality of exact and approximation algorithms for scheduling problems

Cited in

(7)

• A correcting algorithm for solving allocation type problems
• Improved algorithmic results for unsplittable stable allocation problems
• scientific article; zbMATH DE number 4053311 (Why is no real title available?)
• scientific article; zbMATH DE number 4128638 (Why is no real title available?)
• scientific article; zbMATH DE number 610251 (Why is no real title available?)
• Bounding the running time of algorithms for scheduling and packing problems
• Parameterized hardness results for the \textsc{Restricted Santa Claus Problem}

This page was built for publication: Exact algorithms for allocation problems

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