Login / Signup

Almost Optimal Inapproximability of Multidimensional Packing Problems.

Sai Sandeep
Published in: FOCS (2022)
Keyphrases
  • packing problem
  • mixed integer linear program
  • bin packing
  • cutting stock
  • dynamic programming
  • approximation algorithms
  • multi dimensional
  • lot sizing
  • multidimensional data