An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices

Documents similaires

• An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination
  par: Papadopoulos, Kleitos
  Publié: (2026)
• An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
  par: Papadopoulos, Kleitos
  Publié: (2026)
• A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
  par: Papadopoulos, Kleitos
  Publié: (2024)
• A faster algorithm for the construction of optimal factoring automata
  par: Erlebach, Thomas, et autres
  Publié: (2024)
• $O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
  par: Soma, Tasuku, et autres
  Publié: (2025)