Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
From MaRDI portal
Publication:4962739
DOI10.1145/1367064.1367074zbMath1445.68347OpenAlexW1970095041MaRDI QIDQ4962739
Retsef Levi, Shimon (Moni) Shahar, M. I. Sviridenko, Guy Even, Baruch Schieber, Dror Rawitz
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1367064.1367074
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (21)
Capacitated Arc Stabbing ⋮ A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand ⋮ Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Capacitated dynamic lot-sizing problem with delivery/production time windows ⋮ Primal-Dual Schema for Capacitated Covering Problems ⋮ Geometric stabbing via threshold rounding and factor revealing LPs ⋮ Capacitated max-batching with interval graph compatibilities ⋮ Security-aware database migration planning ⋮ The parameterized complexity of stabbing rectangles ⋮ Priority-based bin packing with subset constraints ⋮ Demand Hitting and Covering of Intervals ⋮ A model for minimizing active processor time ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Geometric hitting set for segments of few orientations ⋮ Easy capacitated facility location problems, with connections to lot-sizing ⋮ Unnamed Item ⋮ Parameterized Complexity of Stabbing Rectangles and Squares in the Plane ⋮ Primal-dual schema for capacitated covering problems ⋮ Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities ⋮ Latency Constrained Aggregation in Chain Networks Admits a PTAS ⋮ APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
This page was built for publication: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
