| 90-XX |
|
|
Operations research, mathematical programming |
|
|
90-00 |
General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming |
|
|
90-01 |
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming |
|
|
90-02 |
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming |
|
|
90-03 |
History of operations research and mathematical programming [Consider also classification numbers from Section 01-XX] |
|
|
90-04 |
Software, source code, etc. for problems pertaining to operations research and mathematical programming |
|
|
90-05 |
Experimental work for problems pertaining to operations research and mathematical programming |
|
|
90-06 |
Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming |
|
|
90-08 |
Computational methods for problems pertaining to operations research and mathematical programming |
|
|
90-10 |
Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming |
|
|
90-11 |
Research data for problems pertaining to operations research and mathematical programming |
|
|
90B05 |
Inventory, storage, reservoirs |
|
|
90B06 |
Transportation, logistics and supply chain management |
|
|
90B10 |
Deterministic network models in operations research {For network control, see 93B70} |
|
|
90B15 |
Stochastic network models in operations research {For network control, see 93B70} |
|
|
90B18 |
Communication networks in operations research [See also 68M10, 68M12, 68M18, 94A05] {For networks as computational models, see 68Q06} |
|
|
90B20 |
Traffic problems in operations research |
|
|
90B22 |
Queues and service in operations research [See also 60K25, 68M20] |
|
|
90B25 |
Reliability, availability, maintenance, inspection in operations research [See also 60K10, 62N05] |
|
|
90B30 |
Production models |
|
|
90B35 |
Deterministic scheduling theory in operations research [See also 68M20] |
|
|
90B36 |
Stochastic scheduling theory in operations research [See also 68M20] |
|
|
90B40 |
Search theory |
|
|
90B50 |
Management decision making, including multiple objectives [See also 90C29, 90C31, 91A35, 91B06] |
|
|
90B60 |
Marketing, advertising [See also 91B60] |
|
|
90B70 |
Theory of organizations, manpower planning in operations research [See also 91D35] |
|
|
90B80 |
Discrete location and assignment [See also 90C10] |
|
|
90B85 |
Continuous location |
|
|
90B90 |
Case-oriented studies in operations research |
|
|
90B99 |
None of the above, but in this section |
|
|
90C05 |
Linear programming |
|
|
90C06 |
Large-scale problems in mathematical programming |
|
|
90C08 |
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) |
|
|
90C09 |
Boolean programming |
|
|
90C10 |
Integer programming |
|
|
90C11 |
Mixed integer programming |
|
|
90C15 |
Stochastic programming |
|
|
90C17 |
Robustness in mathematical programming |
|
|
90C20 |
Quadratic programming |
|
|
90C22 |
Semidefinite programming |
|
|
90C23 |
Polynomial optimization |
|
|
90C24 |
Tropical optimization (e.g., max-plus optimization) |
|
|
90C25 |
Convex programming |
|
|
90C26 |
Nonconvex programming, global optimization |
|
|
90C27 |
Combinatorial optimization |
|
|
90C29 |
Multi-objective and goal programming |
|
|
90C30 |
Nonlinear programming |
|
|
90C31 |
Sensitivity, stability, parametric optimization |
|
|
90C32 |
Fractional programming |
|
|
90C33 |
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) |
|
|
90C34 |
Semi-infinite programming |
|
|
90C35 |
Programming involving graphs or networks [See also 05C90, 90C27] |
|
|
90C39 |
Dynamic programming [See also 49L20] |
|
|
90C40 |
Markov and semi-Markov decision processes |
|
|
90C46 |
Optimality conditions and duality in mathematical programming [See also 49N15] |
|
|
90C47 |
Minimax problems in mathematical programming [See also 49K35] |
|
|
90C48 |
Programming in abstract spaces |
|
|
90C49 |
Extreme-point and pivoting methods |
|
|
90C51 |
Interior-point methods |
|
|
90C52 |
Methods of reduced gradient type |
|
|
90C53 |
Methods of quasi-Newton type |
|
|
90C55 |
Methods of successive quadratic programming type |
|
|
90C56 |
Derivative-free methods and methods using generalized derivatives [See also 49J52] |
|
|
90C57 |
Polyhedral combinatorics, branch-and-bound, branch-and-cut |
|
|
90C59 |
Approximation methods and heuristics in mathematical programming |
|
|
90C60 |
Abstract computational complexity for mathematical programming problems [See also 68Q25] |
|
|
90C70 |
Fuzzy and other nonstochastic uncertainty mathematical programming |
|
|
90C90 |
Applications of mathematical programming |
|
|
90C99 |
None of the above, but in this section |
