There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract

Source URL: www.cs.technion.ac.il

• Dynamic programming
• Operations research
• Complexity classes
• Approximation algorithms
• Polynomial-time approximation scheme
• Knapsack problem
• Subset sum problem
• Parameterized complexity
• Optimization problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T

Source URL: www.cs.technion.ac.il

• Complexity classes
• Approximation algorithms
• NP-complete problems
• Matroid theory
• Generalized assignment problem
• Knapsack problem
• Submodular set function
• APX
• Polynomial-time approximation scheme
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Operations research
• Combinatorial optimization
• Bin packing problem
• Knapsack problem
• Packing problem
• Algorithm
• Theoretical computer science
• Computational complexity theory
• Mathematics

PDF Document

Source URL: www.mansci.ovgu.de

• 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

Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th

Source URL: www.mijst.mju.ac.th

• Containers
• Operations research
• Shipping containers
• NP-complete problems
• Discrete geometry
• Packing problem
• Containerization
• Knapsack problem
• Wooden box
• Theoretical computer science
• Computational complexity theory
• Mathematics

A SIMPLIFIED TEST PROCEDURES FOR KNAPSACK (OPERATORCARRIED) SPRAYERS CHAN CHEE WAN CONTENTS I.

Source URL: un-csam.org

• Pesticide application
• Sprayer
• IPARC
• Spray
• Quality assurance
• Technology
• Pesticides
• Environmental engineering
• Pest control

Guide to Giving: Philanthropy Lessons in Preparation for #GivingTuesday LESSON FOUR: Finding your Cause: What Matters Most to You? “It is every man’s obligation to put back into the world at least the equivalent of

Source URL: www.givingtuesday.org

• Humanitarian aid
• Poverty
• Critical race theory
• Racism
• White privilege
• Millennium Development Goals
• Universal Primary Education
• Peggy McIntosh
• Invisible Knapsack
• Socioeconomics
• Economics
• Development

Application of POMAC to the Multiobjective 0/1 Knapsack Problem Rié Komuro E. David Ford

Source URL: www.nrcse.washington.edu

Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for

Source URL: www.cse.iitd.ernet.in

• Operations research
• Combinatorial optimization
• Relaxation
• Convex optimization
• Linear programming relaxation
• Linear programming
• Knapsack problem
• Randomized algorithm
• Lagrangian relaxation
• Mathematical optimization
• Theoretical computer science
• Applied mathematics