scientific article; zbMATH DE number 3510069
From MaRDI portal
Publication:4090116
Cited in
(11)- Discrete extremal problems
- Fast approximation algorithm for job sequencing with deadlines
- Approximation algorithms for the capacitated plant allocation problem
- Online removable knapsack problem under convex function
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- 2D knapsack: packing squares
- 2D knapsack: packing squares
- Online removable knapsack with limited cuts
- The min-Knapsack problem with compactness constraints and applications in statistics
- Single machine scheduling with semi-resumable machine availability constraints
- Online minimization knapsack problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090116)
