494 search results - page 11 / 99 » Optimal Carpet Cutting |
DAC
2001
ACM
14 years 9 months ago
2001
ACM
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
JCAM
2010
13 years 3 months ago
2010
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
MP
2006
13 years 8 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
IMSCCS
2007
IEEE
14 years 2 months ago
2007
IEEE
TOPSAW program was developed by Dr. S. Chang and his team and has been successfully used in the replication of sawmill cutting to determine the optimal cutting pattern for a log t...
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...