scientific article; zbMATH DE number 3510069
From MaRDI portal
Publication:4090116
zbMath0325.90037MaRDI QIDQ4090116
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Approximation algorithms for the capacitated plant allocation problem ⋮ 2D knapsack: packing squares ⋮ The min-Knapsack problem with compactness constraints and applications in statistics ⋮ Online removable knapsack with limited cuts ⋮ Online minimization knapsack problem ⋮ Discrete extremal problems ⋮ Fast approximation algorithm for job sequencing with deadlines ⋮ Single machine scheduling with semi-resumable machine availability constraints ⋮ Online removable knapsack problem under convex function ⋮ 2D Knapsack: Packing Squares ⋮ Scheduling linear deteriorating jobs with an availability constraint on a single machine
