15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia

First Page		Document Content
Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics		15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 134,06 KB Share Document on Facebook

	The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT Abstract— We consider the optimization problem of safety DocID: 1xThh - View Document
	Deadline-Aware Multipath Communication: An Optimization Problem Laurent Chuat∗ , Adrian Perrig∗ , Yih-Chun Hu† of Computer Science, ETH Zurich, Switzerland † Department of Electrical and Computer Engineering, Uni DocID: 1xTc0 - View Document
	Combined Optimization and Reinforcement Learning for Manipulation Skills Peter Englert and Marc Toussaint Machine Learning & Robotics Lab University of Stuttgart, Germany Abstract—This work addresses the problem of how DocID: 1vjBp - View Document
	The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine DocID: 1uZDW - View Document
	Formulating an Optimization Problem DocID: 1uSM0 - View Document