The following pages link to Mathematics of Operations Research (Q103831):
Displaying 50 items.
- Entrepreneurial Decisions on Effort and Project with a Nonconcave Objective Function (Q3465939) (← links)
- Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory (Q3465940) (← links)
- A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies (Q3465941) (← links)
- Directional Metric Regularity of Multifunctions (Q3465942) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- Analogy in Decision Making (Q3465946) (← links)
- Portfolio Optimization with Quasiconvex Risk Measures (Q3465947) (← links)
- Optimal Information Blending with Measurements in the <i>L</i><sup>2</sup> Sphere (Q3465948) (← links)
- Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time (Q4346221) (← links)
- Classification of Acceptance Criteria for the Simulated Annealing Algorithm (Q4346222) (← links)
- Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case (Q4346223) (← links)
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case (Q4346224) (← links)
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations (Q4346225) (← links)
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q4346226) (← links)
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming (Q4346227) (← links)
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems (Q4346228) (← links)
- On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming (Q4346229) (← links)
- A Closed Form Solution for the Asymmetric Random Polling System with Correlated Levy Input Process (Q4346230) (← links)
- The Compactness of a Policy Space in Dynamic Programming Via an Extension Theorem for Carathéodory Functions (Q4346231) (← links)
- Survival and Growth with a Liability: Optimal Portfolio Strategies in Continuous Time (Q4346232) (← links)
- Stationary Strategies for Recursive Games (Q4346233) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- The Performance of Deferred-Acceptance Auctions (Q4595950) (← links)
- The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration (Q4595951) (← links)
- On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces (Q4595952) (← links)
- Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs (Q4595953) (← links)
- Calculating Principal Eigen-Functions of Non-Negative Integral Kernels: Particle Approximations and Applications (Q4595954) (← links)
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three (Q4595955) (← links)
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization (Q4595956) (← links)
- Dynamical Analysis of a Repeated Game with Incomplete Information (Q4595957) (← links)
- On the Width of Semialgebraic Proofs and Algorithms (Q4595958) (← links)
- Optimal Boundary Surface for Irreversible Investment with Stochastic Costs (Q4595959) (← links)
- A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information (Q4595960) (← links)
- Partially Observable Risk-Sensitive Markov Decision Processes (Q4595962) (← links)
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963) (← links)
- Graph Orientations and Linear Extensions (Q4595964) (← links)
- Quantifying Double McCormick (Q4595965) (← links)
- Information and Ambiguity: Toward a Foundation of Nonexpected Utility (Q4595966) (← links)
- A Law of Large Numbers for Limit Order Books (Q4595967) (← links)
- The Traveling Salesman Problem with Distances One and Two (Q4697080) (← links)
- An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity (Q4697081) (← links)
- Queues in Series via Interacting Particle Systems (Q4697082) (← links)
- Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces (Q4697083) (← links)
- Probabilistic Analysis of Network Flow Algorithms (Q4697084) (← links)
- An Approximation for a Continuous Max-Flow Problem (Q4697085) (← links)
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems (Q4697086) (← links)
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems (Q4697087) (← links)
- Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming (Q4697088) (← links)
