|
90-XX
|
Operations research, mathematical programming
|
|
90-00
|
General reference works (handbooks, dictionaries, bibliographies, etc.)
|
|
90-01
|
Instructional exposition (textbooks, tutorial papers, etc.)
|
|
90-02
|
Research exposition (monographs, survey articles)
|
|
90-03
|
Historical {!must also be assigned at least one classification number from section 01}
|
|
90-04
|
Explicit machine computation and programs (not the theory of computation or programming)
|
|
90-06
|
Proceedings, conferences, collections, etc.
|
|
90-08
|
Computational methods
|
|
90Bxx
|
Operations research and management science
|
|
90B05
|
Inventory, storage, reservoirs
|
|
90B06
|
Transportation, logistics
|
|
90B10
|
Network models,deterministic
|
|
90B15
|
Network models, stochastic
|
|
90B18
|
Communication networks
[See also
68M10,
94A05]
|
|
90B20
|
Traffic problems
|
|
90B22
|
Queues and service
[See also
60K25,
68M20]
|
|
90B25
|
Reliability, availability, maintenance, inspection
[See also
60K10,
62N05]
|
|
90B30
|
Production models
|
|
90B35
|
Scheduling theory, deterministic
[See also
68M20]
|
|
90B36
|
Scheduling theory, stochastic
[See also
68M20]
|
|
90B40
|
Search theory
|
|
90B50
|
Management decision making, including multiple objectives
[See also
90C31,
91A35,
91B05]
|
|
90B60
|
Marketing, advertising
[See also
91B60]
|
|
90B70
|
Theory of organizations, manpower planning
[See also
91D35]
|
|
90B80
|
Discrete location and assignment
[See also
90C10]
|
|
90B85
|
Continuous location
|
|
90B90
|
Case-oriented studies
|
|
90B99
|
None of the above, but in this section
|
|
90Cxx
|
Mathematical programming
|
|
90C05
|
Linear programming
|
|
90C06
|
Large-scale problems
|
|
90C08
|
Special problems of linear programming (transportation, multi-index, etc.)
|
|
90C09
|
Boolean programming
|
|
90C10
|
Integer programming
|
|
90C11
|
Mixed integer programming
|
|
90C15
|
Stochastic programming
|
|
90C20
|
Quadratic programming
|
|
90C22
|
Semidefinite programming
|
|
90C25
|
Convex programming
|
|
90C26
|
Nonconvex programming
|
|
90C27
|
Combinatorial optimization
|
|
90C29
|
Multi-objective and goal programming
|
|
90C30
|
Nonlinear programming
|
|
90C31
|
Sensitivity, stability, parametric optimization
|
|
90C32
|
Fractional programming
|
|
90C33
|
Complementarity problems
|
|
90C34
|
Semi-infinite programming
|
|
90C35
|
Programming involving graphs or networks
[See also
90C27]
|
|
90C39
|
Dynamic programming
[See also
49L20]
|
|
90C40
|
Markov and semi-Markov decision processes
|
|
90C46
|
Optimality conditions, duality
[See also
49N15]
|
|
90C47
|
Minimax problems
[See also
49K35]
|
|
90C48
|
Programming in abstract spaces
|
|
90C50
|
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
|
|
90C57
|
Polyhedral combinatorics, branch-and-bound, branch-and-cut
|
|
90C59
|
Approximation methods and heuristics
|
|
90C60
|
Abstract computational complexity for mathematical programming problems
[See also
68Q25]
|
|
90C70
|
Fuzzy programming
|
|
90C90
|
Applications of mathematical programming
|
|
90C99
|
None of the above, but in this section
|