Pages that link to "Mathematics of Operations Research"
Appearance
Showing 100 items.
- Kurtosis (links | edit)
- Presburger arithmetic (links | edit)
- Travelling salesman problem (links | edit)
- Operations research (links | edit)
- Reinforcement learning (links | edit)
- Random optimization (links | edit)
- Chebyshev's inequality (links | edit)
- Shapley value (links | edit)
- Rendezvous problem (links | edit)
- Simplex algorithm (links | edit)
- Randomized algorithm (links | edit)
- Cooperative game theory (links | edit)
- Modern portfolio theory (links | edit)
- Graphic matroid (links | edit)
- Pairwise independence (links | edit)
- Set cover problem (links | edit)
- Markov decision process (links | edit)
- Lloyd Shapley (links | edit)
- Paul Milgrom (links | edit)
- Logarithmically concave function (links | edit)
- Maximum entropy probability distribution (links | edit)
- Secretary problem (links | edit)
- Fully polynomial-time approximation scheme (links | edit)
- Reservation price (links | edit)
- Multi-armed bandit (links | edit)
- Duality (optimization) (links | edit)
- Envelope theorem (links | edit)
- Minimum cut (links | edit)
- Stochastic dominance (links | edit)
- List of mathematics journals (links | edit)
- Screening (economics) (links | edit)
- Ambiguity aversion (links | edit)
- Lattice reduction (links | edit)
- Purification theorem (links | edit)
- List of knapsack problems (links | edit)
- Quasiconvex function (links | edit)
- Auction theory (links | edit)
- Merton's portfolio problem (links | edit)
- Relaxation (approximation) (links | edit)
- Lagrangian relaxation (links | edit)
- Minimum-cost flow problem (links | edit)
- Interval scheduling (links | edit)
- K-set (geometry) (links | edit)
- Robust optimization (links | edit)
- Gittins index (links | edit)
- Subgradient method (links | edit)
- List of systems science journals (links | edit)
- Relaxation (iterative method) (links | edit)
- Roger Myerson (links | edit)
- Smallest-circle problem (links | edit)
- Mathematics of Operations Research (transclusion) (links | edit)
- Bland's rule (links | edit)
- 1-center problem (links | edit)
- Job-shop scheduling (links | edit)
- Hypohamiltonian graph (links | edit)
- Unique sink orientation (links | edit)
- Entitlement (fair division) (links | edit)
- Odds algorithm (links | edit)
- Robert W. Rosenthal (links | edit)
- Product-form solution (links | edit)
- Correlation clustering (links | edit)
- Flow-shop scheduling (links | edit)
- Random binary tree (links | edit)
- Richard Weber (mathematician) (links | edit)
- Imre Bárány (links | edit)
- Oriented matroid (links | edit)
- Metric k-center (links | edit)
- Congestion game (links | edit)
- R. Tyrrell Rockafellar (links | edit)
- Claude Lemaréchal (links | edit)
- Linear bottleneck assignment problem (links | edit)
- John C. Gittins (links | edit)
- Regenerative process (links | edit)
- Shapley–Folkman lemma (links | edit)
- Klee–Minty cube (links | edit)
- Ivar Ekeland (links | edit)
- Ward Whitt (links | edit)
- Jan Karel Lenstra (links | edit)
- Fluid queue (links | edit)
- John W. Pratt (links | edit)
- Thompson sampling (links | edit)
- LP-type problem (links | edit)
- Jean-François Mertens (links | edit)
- Mertens-stable equilibrium (links | edit)
- Robert G. Bland (links | edit)
- Sridhar Tayur (links | edit)
- Lester Dubins (links | edit)
- Projections onto convex sets (links | edit)
- Subadditive set function (links | edit)
- Andrzej Piotr Ruszczyński (links | edit)
- Polling system (links | edit)
- Factorial moment measure (links | edit)
- Michel Balinski (links | edit)
- Abraham Neyman (links | edit)
- Alfredo Noel Iusem (links | edit)
- Farthest-first traversal (links | edit)
- Karim Adiprasito (links | edit)
- Gérard Cornuéjols (links | edit)
- Bayesian-optimal mechanism (links | edit)
- Epi-convergence (links | edit)