Generalized Assignment and Knapsack Problems in the Random-Order Model

Documenti analoghi

• Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
  di: Klimm, Max, et al.
  Pubblicazione: (2022)
• The Fair Periodic Assignment Problem
  di: van Lieshout, Rolf, et al.
  Pubblicazione: (2025)
• Sum-Of-Squares To Approximate Knapsack
  di: Kothari, Pravesh K., et al.
  Pubblicazione: (2025)
• Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
  di: Moeini, Mahdi, et al.
  Pubblicazione: (2024)
• On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
  di: Shi, Haoyan, et al.
  Pubblicazione: (2024)