scientific article; zbMATH DE number 3910134
From MaRDI portal
Publication:3686432
zbMATH Open0569.90060MaRDI QIDQ3686432FDOQ3686432
Authors: L. Ya. Zamanskij, V. D. Cherkasskij 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3924871
- Constrained integer approximation to planar line intersection
- EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
- A linear algorithm for nonhomogeneous spectra of numbers
- Integral points in rational polygons: a numerical semigroup approach
Cited In (7)
- Integer approximation of a segment
- A linear algorithm for integer programming in the plane
- Scheduling with batching: Two job types
- Single machine group scheduling with resource dependent setup and processing times
- Title not available (Why is that?)
- Constrained integer approximation to planar line intersection
- A polynomial algorithm for a one machine batching 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 Q3686432)
