welcome: please sign in
location: Diff for "ProblemsDescription/PackingProblem"
Differences between revisions 1 and 3 (spanning 2 versions)
⇤ ← Revision 1 as of 2011-01-05 13:16:20 →
Size: 176
Editor: CarmenSantoro
Comment:
← Revision 3 as of 2011-01-10 11:03:54 → ⇥
Size: 400
Editor: CarmenSantoro
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
'''Packing Problem''' = Packing Problem =

<<TableOfContents>>

== Problem Description ==
Line 4: Line 8:

== Input format ==

== Output format ==

== Example ==

== Author(s) ==
Author: Neng-Fa Zhou
<<BR>>
Affiliation: CUNY Brooklyn College and Graduate Center, USA

Packing Problem

Contents

  1. Packing Problem
    1. Problem Description
    2. Input format
    3. Output format
    4. Example
    5. Author(s)

Problem Description

Given a rectangular area and a set of rectangles, the problem is to pack the rectangles into the area such that no two rectangles overlap each other.

Input format

Output format

Example

Author(s)

Author: Neng-Fa Zhou
Affiliation: CUNY Brooklyn College and Graduate Center, USA

ASP Competition 2011: ProblemsDescription/PackingProblem (last edited 2011-01-10 11:03:54 by CarmenSantoro)