Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Tolerance analysis for 0-1 knapsack problems
David Pisinger, Alima Saidi
Department of Computer Science
2
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Tolerance analysis for 0-1 knapsack problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Approximate Algorithm
12%
Branch-and-bound
11%
Coefficient
9%
Cutting Planes
11%
Exact Algorithms
10%
Integer
4%
Integer Programming
10%
Interval
5%
Knapsack
11%
Knapsack Problem
66%
Linear programming
8%
Optimal Solution
16%
Tolerance Analysis
94%
Tolerance Limits
81%
Upper bound
6%
Vary
8%
Business & Economics
Branch-and-bound
11%
Coefficients
14%
Cutting Planes
13%
Integer
9%
Integer Programming
10%
Knapsack Problem
74%
Linear Programming
8%
Optimal Solution
16%
Tolerance
59%
Tolerance Analysis
100%
Upper Bound
9%
Engineering & Materials Science
Integer programming
7%
Linear programming
6%