An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A algorithm for two-dimensional packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthogonal Packings in Two Dimensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time bounds for selection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer Programming with a Fixed Number of Variables / rank | |||
Normal rank |
Latest revision as of 11:02, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximation scheme for strip packing of rectangles with bounded dimensions |
scientific article |
Statements
An approximation scheme for strip packing of rectangles with bounded dimensions (English)
0 references
12 August 1998
0 references
strip-packing problem
0 references