On Packing Squares with Resource Augmentation: Maximizing the Profit

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Computing: The Australasian Theory Symposium

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parameterized Approximation Scheme for the Multiple Knapsack Problem

  2009influential reference
• Maximizing the Number of Packed Rectangles

  2004cited by this paper
• New approximability and inapproximability results for 2-dimensional Bin Packing

  2004influential reference
• On rectangle packing: maximizing benefits

  2004cited by this paper
• Approximation schemes for multidimensional packing

  2004influential reference
• New Bounds for Multidimensional Packing

  2003cited by this paper
• Packing 2-dimensional bins in harmony

  2002cited by this paper
• Packing Squares into Squares

  1999cited by this paper
• Makespan minimization in open shops: A polynomial time approximation scheme

  1998cited by this paper
• A Strip-Packing Algorithm with Absolute Performance Bound 2

  1997cited by this paper
• Approximate strip packing

  1996cited by this paper
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems

  1995cited by this paper
• Approximability of flow shop scheduling

  1995cited by this paper
• Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles

  1994cited by this paper
• Packing Squares into a Square

  1990influential reference
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle

  1983cited by this paper
• On Packing Two-Dimensional Bins

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• A 5/4 Algorithm for Two-Dimensional Packing

  1981cited by this paper
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

  1981cited by this paper
• A 2.5 Times Optimal Algorithm for Packing in Two Dimensions

  1980cited by this paper
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

  1980cited by this paper
• Orthogonal Packings in Two Dimensions

  1980cited by this paper
• An optimal bound for two dimensional bin packing

  1975cited by this paper
• On packing of squares and cubes

  1968cited by this paper
• Some packing and covering theorems

  1967cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper

• Approximation Algorithms for Integer Programming with Resource Augmentation

  2025cites this paper
• Weakly Approximating Knapsack in Subquadratic Time

  2025cites this paper
• High Multiplicity Strip Packing

  2019cites this paper
• Two-Dimensional Knapsack for Circles

  2018cites this paper
• Online Square-into-Square Packing

  2014cites this paper
• Packing Squares with Profits

  2012cites this paper
• Approximation algorithms for orthogonal packing problems for hypercubes

  2009cites this paper
• Packing Weighted Rectangles into a Square

  2005cites this paper