Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Mathematical optimization problem
|
| gptkbp:alsoKnownAs |
gptkb:Binary_Integer_Programming
|
| gptkbp:application |
gptkb:Knapsack_problem
Scheduling Resource allocation Network design Set covering problem |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:field |
gptkb:Mathematics
Computer science Operations research |
| https://www.w3.org/2000/01/rdf-schema#label |
0-1 Integer Programming
|
| gptkbp:objectiveFunctionType |
Linear objective function
|
| gptkbp:relatedTo |
gptkb:Integer_programming
mathematical optimization NP-complete problems |
| gptkbp:solvedBy |
gptkb:Branch_and_bound
gptkb:Cutting_plane_method Branch and cut Heuristic algorithms |
| gptkbp:type |
Linear constraints
|
| gptkbp:usedIn |
Computer science
Operations research Mathematical modeling |
| gptkbp:variableDomain |
0 or 1
|
| gptkbp:variableType |
Binary variable
|
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:bfsLayer |
6
|