DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Knapsack problem
Knapsack problem
15.083 Lecture 21: Approximation Algorithsm I
Quadratic Multiple Knapsack Problem with Setups and a Solution Approach
Approximate Algorithms for the Knapsack Problem on Parallel Computers
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Solving Packing Problems with Few Small Items Using Rainbow Matchings
CS-258 Solving Hard Problems in Combinatorial Optimization Pascal
1 Load Balancing / Multiprocessor Scheduling
The Multiobjective Multidimensional Knapsack Problem: a Survey and a New Approach
Greedy Approximation Algorithms Notes
Capacitated Dynamic Programming: Faster Knapsack and Graph
Different Approaches to Solve the 0/1 Knapsack Problem
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
Linear & Quadratic Knapsack Optimisation Problem
Parametric Convex Quadratic Relaxation of the Quadratic Knapsack Problem
Lecture 12: Knapsack Problems
1 Overview 2 Greediness and the Knapsack Problem
Algorithms for Multi-Objective Mixed Integer Programming Problems
Arxiv:1802.09465V1
Top View
1 the Knapsack Problem
Fast Algorithms for Knapsack Via Convolution and Prediction
Lecture 25 1 NP-Complete Problems and General Strategy 2 Knapsack
Notes for Greedy Approximation Algorithms for Knapsack
Chapter 28 Combinatorial Optimization
The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS)
Strategies for Implementing the Knapsack Problem Ms
Approximation Schemes for 0-1 Knapsack
Quadratic Knapsack Problem with Conflict Graphs
Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem
The Quadratic Knapsack Problem—A Survey David Pisinger
Knapsack Problem with Objective Value Gaps Alexandre Dolgui, Mikhail Y
The Rise and Fall of Knapsack Cryptosystems A
Probability Learning Based Tabu Search for the Budgeted Maximum
A Nonlinear Knapsack Problem
The 0–1 Knapsack Problem: a Continuous Generalized Convex Multiplicative Programming Approach
Lecture 17: Finish NP-Completeness, Conp and Friends
Arxiv:1801.04801V1
Lecture Notes: Dynamic Programming (Knapsack and Bin Packing)
Bin-Packing Problem Under Multiple-Criterions
10.1 Introduction 10.2 Knapsack
(1+1) EA for the Chance-Constrained Knapsack Problem with Correlated
Algorithms for Solving Combinatorial Optimization Problems
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version∗
Discrete Optimization 2010 Lecture 10 More About NP-Complete Problems
Public Key Cryptography with Knapsack Systems
An Exact Approach for the 0–1 Knapsack Problem with Setups
Bin-Completion Algorithms for Multicontainer Packing and Covering Problems
1.204 Lecture 16, Branch and Bound: Backtrack Method, Knapsack Problem
Approximation Algorithms for Minimum Knapsack Problem
Lecture 4 1 Overview 2 the Knapsack Problem
Knapsack and Subset Sum with Small Items