Exact algorithms for allocation problems

DOI10.1007/978-3-319-78455-7_19zbMATH Open1446.68190OpenAlexW2789678280MaRDI QIDQ777301FDOQ777301

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

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

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounding the running time of algorithms for scheduling and packing problems
• Title not available (Why is that?)
• A correcting algorithm for solving allocation type problems
• Improved algorithmic results for unsplittable stable allocation problems

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)