Back to search

Clemson University

Improved Mixed-Integer Models of a Two-Dimensional Cutting Stock Problem

Abstract

dc:description.abstract

This paper is concerned with a family of two-dimensional cutting stock problems that seeks to cut rectangular regions from a finite collection of sheets in such a manner that the minimum number of sheets is used. A fixed number of rectangles are to be cut, with each rectangle having a known length and width. All sheets are rectangular, and have the same dimension. We review two known mixed-integer mathematical formulations, and then provide new representations that both economize on the number of discrete variables and tighten the continuous relaxations. A key consideration that arises repeatedly in all models is the enforcement of disjunctions that a vector must lie in the union of a finite collection of polytopes. Computational results demonstrate a relative performance of the different formulations.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematical Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lassiter, William
Contributors dc:contributor
  • Adams, Warren
  • Gupte , Akshay
  • Saltzman , Matthew

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/1944

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lassiter, William. Improved Mixed-Integer Models of a Two-Dimensional Cutting Stock Problem. Thesis thesis, https://open.clemson.edu/all_theses/1944