The following pages link to (Q5588251):
Displayed 50 items.
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- Routing optimization in packet switching communication networks (Q759633) (← links)
- Compatibility of multiple goal programming and the maximize expected utility criterion (Q789286) (← links)
- A framework for the value of information in inventory replenishment (Q884049) (← links)
- Undiscounted approximations of discounted regenerative models (Q1069854) (← links)
- Balancing capacity and lot sizes (Q1072433) (← links)
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey (Q1075251) (← links)
- Linear programming formulations of Markov decision processes (Q1075957) (← links)
- Semi-Markov dynamic programming approach to competitive bidding with state space reduction considerations (Q1093524) (← links)
- Possibility and necessity in optimization (Q1099784) (← links)
- Control of economic systems under the process of data improvement (Q1111909) (← links)
- Solving dynamic optimization problems on a personal computer using an electronic spreadsheet (Q1115815) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- Development and evaluation of five fuzzy multiattribute decision-making methods (Q1125790) (← links)
- On the control of care supply and demand in a urology department (Q1135772) (← links)
- Examination of simulation output using spectral methods (Q1139355) (← links)
- Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato (Q1148802) (← links)
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions (Q1153654) (← links)
- Interactive fuzzy linear programming (Q1192477) (← links)
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions (Q1223621) (← links)
- Myocardial blood perfusion and transport modeling using inert-tracer techniques: a review and recent investigations (Q1226968) (← links)
- Multi-item lot size determination and scheduling under capacity constraints (Q1243659) (← links)
- Semi-stationary clearing processes (Q1244006) (← links)
- A language and a program for stating and solving combinatorial problems (Q1245009) (← links)
- Dominance stochastic models in data envelopment analysis (Q1278396) (← links)
- Survey of mathematical programming models in air pollution management (Q1278448) (← links)
- System stability and optimal control (Q1286601) (← links)
- Vendor selection with price breaks (Q1309983) (← links)
- Randomised sequential probability ratio tests for stochastic processes (Q1330196) (← links)
- Different approaches to a flow shop problem (Q1331623) (← links)
- Multiple items procurement under stochastic nonstationary demands (Q1390261) (← links)
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. (Q1569192) (← links)
- Approximating separable nonlinear functions via mixed zero-one programs (Q1591598) (← links)
- The conical methodology and the evolution of simulation model development (Q1805478) (← links)
- A spreadsheet modelling approach to the assortment problem (Q1809826) (← links)
- Satisficing DEA models under chance constraints (Q1816907) (← links)
- Stability of the constant cost dynamic lot size model (Q1821681) (← links)
- Stochastic clearing systems (Q1843272) (← links)
- A direct heuristic algorithm for linear programming (Q1971659) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- Generalized transportation networks with stochastic demands: An operator theoretic approach (Q3206641) (← links)
- A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
- Lot sizing algorithms with applications to engineering and economics (Q3332745) (← links)
- Generalized versions and extensions of Trypia's blending problem (Q3468864) (← links)
- Optimal experimental control in econometrics: the simultaneous equation problem (Q3675846) (← links)
- Piecewise-linear programming: The compact (CPLP) algorithm (Q3754440) (← links)
- Chance-Constrained programming problem with Chance-Constrained relative lower bounded variables (Q3888850) (← links)
- An algorithm for then×n optimum assignment problem (Q3890004) (← links)
- A network algorithm for the exact treatment of the 2×k contingency table (Q3899328) (← links)
- An iterative method for approximating average cost optimal (s,S) inventory policies (Q4042819) (← links)