epub @ SUB HH

90Cxx Mathematical programming ( 0 Dok. )

• 90C05 Linear programming ( 0 Dok. )
• 90C06 Large-scale problems ( 0 Dok. )
• 90C08 Special problems of linear programming (transportation, multi-index, etc.) ( 0 Dok. )
• 90C09 Boolean programming ( 0 Dok. )
• 90C10 Integer programming ( 0 Dok. )
• 90C11 Mixed integer programming ( 0 Dok. )
• 90C15 Stochastic programming ( 0 Dok. )
• 90C20 Quadratic programming ( 0 Dok. )
• 90C22 Semidefinite programming ( 0 Dok. )
• 90C25 Convex programming ( 0 Dok. )
• 90C26 Nonconvex programming ( 0 Dok. )
• 90C27 Combinatorial optimization ( 0 Dok. )
• 90C29 Multi-objective and goal programming ( 0 Dok. )
• 90C30 Nonlinear programming ( 0 Dok. )
• 90C31 Sensitivity, stability, parametric optimization ( 0 Dok. )
• 90C32 Fractional programming ( 0 Dok. )
• 90C33 Complementarity problems ( 0 Dok. )
• 90C34 Semi-infinite programming ( 0 Dok. )
• 90C35 Programming involving graphs or networks ( 0 Dok. )
• 90C39 Dynamic programming ( 0 Dok. )
• 90C40 Markov and semi-Markov decision processes ( 0 Dok. )
• 90C46 Optimality conditions, duality ( 0 Dok. )
• 90C47 Minimax problems ( 0 Dok. )
• 90C48 Programming in abstract spaces ( 0 Dok. )
• 90C50 Extreme-point and pivoting methods ( 0 Dok. )
• 90C51 Interior-point methods ( 0 Dok. )
• 90C52 Methods of reduced gradient type ( 0 Dok. )
• 90C53 Methods of quasi-Newton type ( 0 Dok. )
• 90C55 Methods of successive quadratic programming type ( 0 Dok. )
• 90C56 Derivative-free methods ( 0 Dok. )
• 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut ( 0 Dok. )
• 90C59 Approximation methods and heuristics ( 0 Dok. )
• 90C60 Abstract computational complexity for mathematical programming problems ( 0 Dok. )
• 90C70 Fuzzy programming ( 0 Dok. )
• 90C90 Applications of mathematical programming ( 0 Dok. )
• 90C99 None of the above, but in this section ( 0 Dok. )