The following pages link to Mathematics of Operations Research (Q103831):
Displayed 50 items.
- Matrices with Identical Sets of Neighbors (Q2757569) (← links)
- The Geometry of Fractional Stable Matchings and Its Applications (Q2757570) (← links)
- A General Class of Greedily Solvable Linear Programs (Q2757571) (← links)
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem (Q2757572) (← links)
- Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties (Q2757573) (← links)
- Positive Dependence Properties of Conditionally Independent Random Lifetimes (Q2757574) (← links)
- The Cost of Achieving the Best Portfolio in Hindsight (Q2757576) (← links)
- On Computing the Nucleolus of a Balanced Connected Game (Q2757577) (← links)
- Discounted Stochastic Games (Q2757578) (← links)
- On a Representation of the Matching Polytope Via Semidefinite Liftings (Q2757579) (← links)
- State Dependent Expected Utility for Savage's State Space (Q2757580) (← links)
- Small Min-Cut Polyhedra (Q2757581) (← links)
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs (Q2757582) (← links)
- Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists (Q2757583) (← links)
- M-Convex Function on Generalized Polymatroid (Q2757584) (← links)
- Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks (Q2757586) (← links)
- Separating Maximally Violated Comb Inequalities in Planar Graphs (Q2757587) (← links)
- Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming (Q2757588) (← links)
- Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming (Q2757589) (← links)
- Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier (Q2757590) (← links)
- Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors (Q2757591) (← links)
- Solutions to Affine Generalized Equations Using Proximal Mappings (Q2757592) (← links)
- The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization (Q2757593) (← links)
- Weak Univalence and Connectedness of Inverse Images of Continuous Functions (Q2757594) (← links)
- Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem (Q2757595) (← links)
- The Complexity of Optimal Queuing Network Control (Q2757596) (← links)
- Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case (Q2757597) (← links)
- Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case (Q2757598) (← links)
- Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems (Q2757599) (← links)
- Random Sampling in Cut, Flow, and Network Design Problems (Q2757600) (← links)
- Transience Bounds for Long Walks (Q2757602) (← links)
- Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems (Q2757604) (← links)
- Stochastic Convexity on General Space (Q2757605) (← links)
- On the Epiconvergence of Stochastic Optimization Problems (Q2757606) (← links)
- Martingale Measures and Hedging for Discrete-Time Financial Markets (Q2757607) (← links)
- Repeated Games with Endogenous Choice of Information Mechanisms (Q2757608) (← links)
- Generalized “Big-Match” (Q2757609) (← links)
- Mean Cost Cyclical Games (Q2757610) (← links)
- Ill-Conditioned Convex Processes and Conic Linear Systems (Q2757611) (← links)
- Stochastic Orderings of Convex/Concave-Type on an Arbitrary Grid (Q2757612) (← links)
- Interlacing Eigenvalues in Time Reversible Markov Chains (Q2757613) (← links)
- Spatial Queueing Processes (Q2757614) (← links)
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases (Q2757616) (← links)
- Two-Machine No-Wait Flow Shop Scheduling with Missing Operations (Q2757617) (← links)
- Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes (Q2757618) (← links)
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity (Q2757619) (← links)
- The Maxmin of Recursive Games with Incomplete Information on one Side (Q2757620) (← links)
- The Quickest Transshipment Problem (Q2757622) (← links)
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines (Q2757623) (← links)
- Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow (Q2757624) (← links)