Instance-Sensitive Robustness Guarantees for Sequencing with Unknown Packing and Covering Constraints∗ [Extended Abstract] † ‡

Source URL: www.coga.tu-berlin.de

• Mathematical analysis
• Knapsack problem
• Dynamic programming
• Mathematical optimization
• Pi
• Μ operator
• Operations research
• Theoretical computer science
• Applied mathematics

Recommended for High School Students Cont.’ Nineteen Minutes by Jodi Picoult Peter has been the victim of bullying since his first day of kindergarten, Then one day he walks into Sterling High with a knapsack full of g

Source URL: www.olis.ri.gov

• Persecution
• Social psychology
• Bullying
• Human behavior
• Cyber-bullying
• Life
• The Clique
• Nineteen Minutes
• School bullying
• Abuse
• Ethics
• Behavior

Private Albert H. Davis of 6th New Hampshire Infantry Regiment with Model 1841 Mississippi rifle, sword bayonet, knapsack with bedroll, canteen, and haversack

Source URL: www.loc.gov

Soldier in Confederate uniform holding 1841 "Mississippi" rifle, Sheffield-type Bowie knife, canteen, box knapsack, blanket roll, and cartridge box

Source URL: www.loc.gov

Wesley’s 5th Annual Knapsack Drive GIVE BACK - FILL A KNAPSACK! You can ensure that the 1 in 4 children living in poverty in Hamilton begin school ready to succeed!

Source URL: www.wesley.ca

• Media technology
• Visual arts
• Pencil
• Crayon
• Ice pack
• Knapsack
• Eraser
• Backpack
• Stationery
• Technology
• Writing instruments

A Genetic Algorithm for the Two-Dimensional Knapsack Problem with Rectangular Pieces

Source URL: www.fernuni-hagen.de

• Combinatorial optimization
• Operations research
• Packaging
• Bin packing problem
• Genetic algorithm
• Packing problem
• Knapsack problem
• Heuristic
• Mathematical optimization
• Theoretical computer science
• Mathematics
• Applied mathematics

A Tree Search Algorithm for Solving the Container Loading Problem

Source URL: www.fernuni-hagen.de

• Discrete geometry
• NP-complete problems
• Packaging
• Packing problem
• BL1
• Box
• Knapsack problem
• Bin packing problem
• Cuboid
• Mathematics
• Theoretical computer science
• Geometry

Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed]

Source URL: www.coga.tu-berlin.de

• Operations research
• Complexity classes
• Mathematical optimization
• Approximation algorithms
• Job shop scheduling
• Polynomial-time approximation scheme
• Knapsack problem
• Optimization problem
• Dynamic programming
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed]

Source URL: www.coga.tu-berlin.de

• Complexity classes
• NP-complete problems
• Operations research
• Mathematical optimization
• Bin packing problem
• Polynomial-time approximation scheme
• Job shop scheduling
• Knapsack problem
• Strongly NP-complete
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Solving Knapsack Problems with Attribute Grammars Michael O’Neill, Robert Cleary, and Nikola Nikolov Biocomputing & Developmental Systems Group University of Limerick, Ireland [removed], [removed],

Source URL: www.cs.bham.ac.uk

• Compiler construction
• Combinatorial optimization
• NP-complete problems
• Operations research
• Knapsack problem
• Context-free grammar
• Attribute grammar
• Formal grammar
• Constraint
• Theoretical computer science
• Formal languages
• Applied mathematics