List of NP-complete Problems - Mathematical Programming

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

Other articles related to "mathematical, mathematical programming, programming":

Martin Beale - Career
... graduating with First Class Honours in Mathematics in 1949 and gaining a Diploma in Mathematical Statistics in 1950 ... He was Chairman of the Mathematical Programming Society from 1974 to 1976, Vice President of the Royal Statistical Society from 1978 to 1980, a Fellow of the ... In 1979, he was elected a Fellow of the Royal Society "for his applications of mathematical and statistical techniques to industrial problems and for ...
Multi-criteria Decision Analysis - Foundations, Concepts, Definitions - A Typology
... Multiple-criteria design problems (multiple objective mathematical programming problems) In these problems, the alternatives are not explicitly known ... alternative (solution) can be found by solving a mathematical model ... the most well-known of these methods is goal programming ...

Famous quotes containing the words programming and/or mathematical:

    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)

    It is by a mathematical point only that we are wise, as the sailor or the fugitive slave keeps the polestar in his eye; but that is sufficient guidance for all our life. We may not arrive at our port within a calculable period, but we would preserve the true course.
    Henry David Thoreau (1817–1862)