Statements (53)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization method
|
| gptkbp:abbreviation |
gptkb:ILP
|
| gptkbp:application |
resource allocation
scheduling supply chain optimization network design |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:formedBy |
20th century
|
| https://www.w3.org/2000/01/rdf-schema#label |
integer linear programming
|
| gptkbp:notablePerson |
gptkb:George_Dantzig
gptkb:Ralph_Gomory gptkb:Jack_Edmonds |
| gptkbp:objectiveFunctionType |
linear
|
| gptkbp:relatedTo |
gptkb:traveling_salesman_problem
gptkb:knapsack_problem gptkb:vertex_cover_problem gptkb:bin_packing_problem gptkb:cutting_stock_problem combinatorial optimization linear programming assignment problem maximum flow problem mixed-integer programming set covering problem 0-1 integer programming minimum cost flow problem binary integer programming mixed-integer linear programming |
| gptkbp:solvedBy |
gptkb:CBC
gptkb:CPLEX gptkb:Gurobi gptkb:SCIP gptkb:GLPK branch and bound branch and cut cutting plane method branch and price |
| gptkbp:type |
integer variables
|
| gptkbp:usedIn |
finance
logistics manufacturing telecommunications energy systems vehicle routing crew scheduling airline scheduling |
| gptkbp:bfsParent |
gptkb:Set_cover_problem
gptkb:Branch_and_bound gptkb:Set_Cover_Problem |
| gptkbp:bfsLayer |
7
|