Category:Operations research

C

• [+] Constraint satisfaction (1 C, 55 P)

D

• [+] Decision theory (9 C, 159 P)

J

• [+] John von Neumann Theory Prize winners (18 P)

M

• [+] Management science (2 C, 22 P)

M cont.

• [+] Mathematical optimization (4 C, 165 P)
• [+] Modeling and simulation (1 C, 45 P)

N

• [+] Network theory (2 C, 16 P)

O

• [+] Operations researchers (2 C, 64 P)

O cont.

• [+] Optimization algorithms (3 C, 94 P)

Q

• [+] Queueing theory (5 C, 32 P)

S

• [+] Scheduling (computing) (4 C, 13 P)
• [+] Simulation (4 C, 16 P)

• Operations research
• Transportation Science

1

• 1-center problem

A

• AMPL (programming language)
• Algebraic modeling language
• Algorithm engineering
• Algorithm design
• Ariadne's thread (logic)
• Arthur D. Little

B

• Backtracking
• Bayesian experimental design
• Behavioral Operations Research
• Bondareva–Shapley theorem

C

• COIN-OR
• Canadian traveller problem
• Carrying cost
• Critical path method
• Cutting stock problem

D

• Data envelopment analysis
• Decision analysis
• Differential evolution
• Divide and conquer algorithm
• Dynamic lot size model
• Dynamic simulation

E

• Economic Lot Scheduling Problem
• Economic order quantity
• Ellipsoid method
• Energy minimization
• Event chain diagram
• Event chain methodology
• Evidential reasoning approach
• Extended Newsvendor models

F

• Facility location
• Flow network

G

• General Algebraic Modeling System
• Generalized assignment problem
• Genetic algorithm scheduling
• Genetic programming
• Geometric median
• Goal programming

G cont.

• Government Operational Research Service

H

• Hilbert basis (linear programming)
• Hyper-heuristic

I

• Industrial engineering
• Industrial engineering and operations research
• Institute for Operations Research and the Management Sciences
• Interfaces (operations research)
• Interservice/Industry Training, Simulation and Education Conference
• Inventory
• Inventory theory

J

• Jeep problem
• Job Shop Scheduling
• Job-shop problem
• Johnson's Rule

K

• Knapsack problem

L

• Least cost planning methodology
• Leverage Point Modeling
• Linear scheduling method
• Linear programming
• Linear programming decoding
• Linear-fractional programming
• Little's law

M

• MIT-Leaders for Manufacturing
• MPS (format)
• Management Science: A Journal of the Institute for Operations Research and the Management Sciences
• Management engineering (healthcare)
• Management science
• Manufacturing & Service Operations Management
• Marketing Science
• Master of Management in Operations Research
• Mathematical model
• Mathematical Programming Society
• Mathematics of Operations Research
• Metaheuristic
• Military Operations Research Society
• Mining simulator
• Model management
• Monge array
• Multiscale decision making

N

• Nelder-Mead method

N cont.

• Newsvendor
• Nonlinear programming

O

• OpenEaagles
• OpenOpt
• Operations and technology management
• Operations Research Society of South Africa
• Operations Research: A Journal of the Institute for Operations Research and the Management Sciences
• Optimal design
• Optimal maintenance
• Optimization (mathematics)

P

• Paradiseo
• Participatory modeling
• Peace gaming
• Plan
• Pollaczek-Khinchine formula
• Purchasing

Q

• Queueing theory

R

• Response surface methodology

S

• Safe sex makespan
• Scheduling (computing)
• Semidefinite programming
• Sequence dependent setup
• Set TSP problem
• Shadow price
• Simplex algorithm
• Simulation
• Simulation Interoperability Standards Organization
• Standard Boolean model
• Stochastic programming
• Strategic Bombing Survey (Atomic attacks)
• Supnick matrix
• System Archetypes
• System dynamics

T

• Theory of two-level planning
• Travelling salesman problem

U

• Uncertainty quantification
• United States Army Training and Doctrine Command Analysis Center

V

• Vehicle routing problem

W

• WalkSAT