Mathematical Programming
- Integer linear programming
- 0-1 linear programming
- Quadratic programming (NP-hard in some cases, P if convex)
- Cost-parametric linear programming
- Feasible basis extension
- Open hemisphere
- K-relevancy
- Traveling salesman polytope non-adjacency
- Knapsack
- Integer knapsack
- Continuous multiple choice knapsack
- Partially ordered knapsack
- Generalized assignment problem
- Comparative vector inequalities
- Selecting a maximum volume submatrix – Problem of selecting the best conditioned subset of a larger m x n matrix. This class of problem is associated with Rank revealing QR factorizations and D optimal experimental design.
- Sparse approximation
Read more about this topic: List Of NP-complete Problems
Famous quotes containing the words mathematical and/or programming:
“The circumstances of human society are too complicated to be submitted to the rigour of mathematical calculation.”
—Marquis De Custine (1790–1857)
“If there is a price to pay for the privilege of spending the early years of child rearing in the driver’s seat, it is our reluctance, our inability, to tolerate being demoted to the backseat. Spurred by our success in programming our children during the preschool years, we may find it difficult to forgo in later states the level of control that once afforded us so much satisfaction.”
—Melinda M. Marshall (20th century)