Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, August 18, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Mutsunori Yagiura (Kyoto University)

Exact Algorithms for Two-Dimensional Strip Packing Problems

We examine various strategies for exact approaches to the 2-dimensional strip packing problem (2SP) with and without rotations. We first develop branch-and-bound algorithms based on sequence-pair representation. We then consider the perfect packing problem (PP), which is a special case of 2SP in that it calls for a packing of given rectangles without wasted space, and propose new branching rules and bounding operations in branch-and-bound algorithms for PP. Computational results on benchmark instances with up to 30 rectangles discloses that one of these rules is very effective especially for feasible instances of PP.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login