Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
NP-complete problem |
| gptkbp:application |
vehicle routing
crew scheduling airline scheduling |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
Given a universe and a collection of its subsets, select a subcollection of disjoint subsets whose union is the universe.
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstProvenNPCompleteBy |
gptkb:Richard_Karp
|
| gptkbp:form |
0-1 integer programming
|
| https://www.w3.org/2000/01/rdf-schema#label |
Set partitioning problem
|
| gptkbp:notable_for |
Karp, R. M. (1972). Reducibility among combinatorial problems.
Schrijver, A. (2003). Combinatorial Optimization: Polyhedra and Efficiency. |
| gptkbp:objective |
minimization
maximization |
| gptkbp:relatedTo |
gptkb:set_packing_problem
integer programming set cover problem |
| gptkbp:solvedBy |
branch and bound
cutting planes column generation |
| gptkbp:type |
equality constraints
disjointness constraints |
| gptkbp:yearNPCompletenessProven |
1972
|
| gptkbp:bfsParent |
gptkb:Integer_Linear_Programming
gptkb:Branch_and_price |
| gptkbp:bfsLayer |
8
|