Knapsack - PDFSEARCH.IO - Document Search Engine

Knapsack
Results: 173

#	Item
11	How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Geometry Polygons Mathematics Space Art gallery problem Polygon Vertex Convex polygon Simple polygon Star polygon Visibility graph Knapsack problem
12	COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used Add to Reading List Source URL: www.amsterdamoptimization.com Language: English - Date: 2011-03-16 12:56:11 Operations research Mathematics Mathematical analysis Computational complexity theory Knapsack problem Cutting stock problem Dynamic programming Pi Linear programming Mathematical optimization Column generation
13	CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-09-29 11:39:15 Computational complexity theory Mathematics Applied mathematics Packing problems Operations research Algorithm Mathematical logic Theoretical computer science Online algorithm Bin packing problem Sorting algorithm Knapsack problem
14	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
15	CS364A: Algorithmic Game Theory Lecture #4: Algorithmic Mechanism Design∗ Tim Roughgarden† October 2, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:26:58 Game theory Mechanism design Auction theory Decision theory Gaming Revelation principle Knapsack problem Algorithmic mechanism design Vickrey auction First-price sealed-bid auction Algorithmic game theory Auction
16	CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves∗ Tim Roughgarden† November 5, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-29 15:44:35 Operations research Mathematical optimization Mathematics Packing problems Mathematical analysis Academia Cryptography Knapsack problem Multi-objective optimization Pareto efficiency Probability distribution Pareto distribution
17	knapsack and blanket roll Add to Reading List Source URL: 26nc.org Language: English - Date: 2013-09-01 22:14:45 Clothing Bags Luggage Camping equipment Backpack Hiking equipment Haversack Shoulder strap Strap
18	Distributed Computing Prof. R. Wattenhofer B/M/S/G Plan my vacation Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-06-14 07:19:14 Mathematics Cryptography Operations research Dynamic programming Knapsack problem Algorithm Applied mathematics
19	CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-19 21:14:11 Mechanism design Computational complexity theory Game theory Decision theory VickreyClarkeGroves auction VickreyClarkeGroves mechanism Incentive compatibility Knapsack problem Randomized rounding Time complexity Random-sampling mechanism Bayesian-optimal mechanism
20	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity

UPDATE