A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

First Page		Document Content
Date: 2008-12-04 03:03:05 Theoretical computer science Computational complexity theory Mathematics Constraint programming Numerical software Automated theorem proving DPLL algorithm Packing problems Solver Constraint satisfaction Reduction Algorithm		A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1 Add to Reading List Source URL: ceur-ws.org Download Document from Source Website File Size: 154,82 KB Share Document on Facebook

	A COMPARISON OF OPTIMIZATION METHODS FOR MULTI-OBJECTIVE CONSTRAINED BIN PACKING PROBLEMS Philippe Olivier DocID: 1uIDg - View Document
	A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 DocID: 1rs14 - View Document
	Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1 DocID: 1rlHb - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document
	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted DocID: 1rdoS - View Document