scientific article; zbMATH DE number 3510069
From MaRDI portal
Publication:4090116
zbMATH Open0325.90037MaRDI QIDQ4090116FDOQ4090116
Authors: L. G. Babat 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (11)
- Approximation algorithms for the capacitated plant allocation problem
- 2D knapsack: packing squares
- Single machine scheduling with semi-resumable machine availability constraints
- Fast approximation algorithm for job sequencing with deadlines
- Discrete extremal problems
- The min-Knapsack problem with compactness constraints and applications in statistics
- Online removable knapsack problem under convex function
- Online minimization knapsack problem
- 2D knapsack: packing squares
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Online removable knapsack with limited cuts
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)
