Computational problem - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2012-05-21 04:38:13 Operations research Combinatorial optimization Packaging Discrete geometry NP-complete problems Knapsack problem Bin packing problem Packing problem Cutting stock problem Theoretical computer science Computational complexity theory Mathematics		Add to Reading List Source URL: www.mansci.ovgu.de Download Document from Source Website File Size: 306,56 KB Share Document on Facebook

	Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology DocID: 1xTCQ - View Document
	Sage Reference Manual: Combinatorial and Discrete Geometry Release 8.3 The Sage Development Team DocID: 1vfet - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo Murota DocID: 1v6lO - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo Murota DocID: 1uq8J - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo Murota DocID: 1uci8 - View Document