The following pages link to Operations Research (Q71781):
Displayed 50 items.
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q71782) (← links)
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon (Q79712) (← links)
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators (Q81045) (← links)
- A Markov Chain Approach to Baseball (Q128645) (← links)
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost (Q140106) (← links)
- Transform formulae for linear functionals of affine processes and their bridges on positive semidefinite matrices (Q2444649) (← links)
- The Dynamic and Stochastic Knapsack Problem (Q2770073) (← links)
- Evidence Propagation and Value of Evidence on Influence Diagrams (Q2770075) (← links)
- Computing Loss Probabilities in Discrete-Time Queues (Q2770076) (← links)
- A Note on the Optimal Positioning of Service Units (Q2770077) (← links)
- Applying Experimental Design and Regression Splines to High-Dimensional Continuous-State Stochastic Dynamic Programming (Q2770078) (← links)
- Large-Scale Convex Optimization Via Saddle Point Computation (Q2770079) (← links)
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness (Q2770081) (← links)
- Partition-Reversible Markov Processes (Q2770083) (← links)
- Control of a Single-Server Tandem Queueing System with Setups (Q2770084) (← links)
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (Q2770085) (← links)
- Algorithms for Separable Nonlinear Resource Allocation Problems (Q2770087) (← links)
- On Derivative Estimation of the Mean Time to Failure in Simulations of Highly Reliable Markovian Systems (Q2770088) (← links)
- Formulation of the Russell-Yasuda Kasai Financial Planning Model (Q2770090) (← links)
- Concepts, Technical Issues, and Uses of the Russell-Yasuda Kasai Financial Planning Model (Q2770092) (← links)
- A Primal Method for the Solution of the Groundwater Quality Management Problem (Q2770093) (← links)
- From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems (Q2770094) (← links)
- Models for Design and Control of Single Server Polling Computer and Communication Systems (Q2770095) (← links)
- Dynamic Scheduling of a Two-Class Queue with Setups (Q2770096) (← links)
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming (Q2770097) (← links)
- Near-Optimal Echelon-Stock (R, nQ) Policies in Multistage Serial Systems (Q2770098) (← links)
- Strong Stochastic Bounds for the Stationary Distribution of a Class of Multicomponent Performability Models (Q2770099) (← links)
- Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming (Q2770100) (← links)
- Stopping Rules for a Class of Sampling-Based Stochastic Programming Algorithms (Q2770101) (← links)
- Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics (Q2770102) (← links)
- Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem (Q2770103) (← links)
- A Capacitated Production-Inventory Model with Periodic Demand (Q2770105) (← links)
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation (Q2770106) (← links)
- Quantum Mechanical and Human Violations of Compound Probability Principles: Toward a Generalized Heisenberg Uncertainty Principle (Q2770107) (← links)
- Structural Analysis of a Queueing System with Multiclasses of Correlated Arrivals and Blocking (Q2770108) (← links)
- Random Yield and Random Demand in a Production System with Downward Substitution (Q2770109) (← links)
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques (Q2770110) (← links)
- Cramér-von Mises Variance Estimators for Simulations (Q2770111) (← links)
- M/M/1 Queues with Switching Costs and Hysteretic Optimal Control (Q2770112) (← links)
- Bounds and Policies for Dynamic Routing in Loss Networks (Q2770114) (← links)
- Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs (Q2770115) (← links)
- An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem (Q2770116) (← links)
- The Assignment Problem with Seniority and Job Priority Constraints (Q2770118) (← links)
- Combined Pricing and Inventory Control Under Uncertainty (Q2770119) (← links)
- Heavy Traffic Analysis of Polling Systems in Tandem (Q2770120) (← links)
- Rendezvous Search on the Interval and the Circle (Q2770121) (← links)
- The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm (Q2770123) (← links)
- Core Problems in Knapsack Algorithms (Q2770124) (← links)
- Multilevel Splitting for Estimating Rare Event Probabilities (Q2770125) (← links)
- Single-Period Multiproduct Inventory Models with Substitution (Q2770126) (← links)