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

	Call for Papers - NSV 2015 8th Workshop on Numerical Software Veriﬁcation PC Co-Chairs Important Dates Submission Notiﬁcation DocID: 1xVB4 - View Document
	Numerical quality: an industrial case study on code_aster Numerical Software Verication DocID: 1xUDq - View Document
	Third International Workshop on Numerical Software Verification Formal verification of numerical programs: from C annotated programs to Coq proofs Sylvie Boldo INRIA Saclay - ˆIle-de-France DocID: 1xT6j - View Document
	Downloaded by [the Bodleian Libraries of the University of Oxford] at 00:41 03 NovemberOptimization Methods & Software iFirst, 2011, 1–23 Evaluation complexity of adaptive cubic regularization methods DocID: 1vlOh - View Document
	User’s Manual for SyGRD (System of Graph Reading and numerical data Displaying with image analysis software) Version 2.00 Ohmi, Hirokazu and JCPRG October 12, 2001 Revised March 9, 2002 DocID: 1vk0v - View Document