The following pages link to Operations Research (Q71781):
Displaying 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)
