Pages that link to "Item:Q3031760"
From MaRDI portal
The following pages link to ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Q3031760):
Displayed 50 items.
- Risk attitude and metric Bernoulli-decision-rule (Q3031761) (← links)
- An approximate solution of the flow-shop problem with sequence dependent setup times (Q3035126) (← links)
- A note on an optimal choice problem (Q3135909) (← links)
- Optimal dynamic investment with learning by doing in the adjustment cost function (Q3135910) (← links)
- Generalized median solutions, strategy-proofness and strictly convex norms (Q3135911) (← links)
- Cyclic Bernoulli polling (Q3135912) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- Statistically varyingN-person games with incomplete information (Q3197647) (← links)
- Upper bounds for the homogeneous case of a two-dimensional packing problem (Q3352854) (← links)
- A procedure for finding Nash equilibria in bi-matrix games (Q3354485) (← links)
- Pattern scheduling (Q3358511) (← links)
- Optimization over the efficient set using an active constraint approach (Q3363070) (← links)
- The generalized HNBUE (HNWUE) class of life distributions (Q3468499) (← links)
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873) (← links)
- A vector variational inequality and optimization over an efficient set (Q3468901) (← links)
- Connections between generalized, inexact and semi-infinite linear programming (Q3470252) (← links)
- k-Best constrained bases of a matroid (Q3470256) (← links)
- Complete efficiency and interdependencies between objective functions in vector optimization (Q3470265) (← links)
- Optimization and optimality test for the Max-Cut Problem (Q3479833) (← links)
- A full information pricing problem for the sale of several identical commodities (Q3484587) (← links)
- A simple procedure for optimal load dispatch using parametric programming (Q3484656) (← links)
- Output learning and duality in joint production programs (Q3494329) (← links)
- Beat the clock (Q3813644) (← links)
- Approximating the departure process from aG/G/1 loss system (Q3817419) (← links)
- Absolute bounds on optimal cost for a class of set covering problems (Q3818802) (← links)
- Optimal module sizing in VLSI floorplanning by nonlinear programming (Q3820400) (← links)
- Algorithms for flows with parametric capacities (Q3823390) (← links)
- On the development of manpower number and recruitment in the civil service (Q3823404) (← links)
- Stability of efficiency evaluations in data envelopment analysis (Q3824122) (← links)
- The facets of the asymmetric 5-city traveling salesman polytope (Q3824124) (← links)
- Deterministic approximations of probability inequalities (Q3825842) (← links)
- Preemptive scheduling with staircase and piecewise linear resource availability (Q3830806) (← links)
- A linear programming approach to water-resources optimization (Q3830811) (← links)
- A bisection/successive approximation method for computing Gittins indices (Q3970270) (← links)
- A finite cutting plane method for facial disjunctive programs (Q3971356) (← links)
- Algorithms for stochastic games ? A survey (Q3984137) (← links)
- Structural results for partially observed control models (Q3984138) (← links)
- Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes (Q3984139) (← links)
- An analysis of setup cost reduction in a two stage system (Q3984140) (← links)
- On generalized gradients (Q4009792) (← links)
- Time complexity of single machine scheduling with stochastic precedence constraints (Q4009793) (← links)
- Insights into the interior-point methods (Q4009794) (← links)
- Computation of efficient solutions of discretely distributed stochastic optimization problems (Q4009795) (← links)
- Generating structure editor interfaces for OR procedures (Q4009796) (← links)
- Maximizing set function formulation of two scheduling problems (Q4015963) (← links)
- TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix (Q4015964) (← links)
- Calendarization of time planning in MPM networks (Q4015965) (← links)
- On alternativep-center problems (Q4015966) (← links)
- An optimal choice problem for a set of checking procedures (Q4015967) (← links)
- New product advertising in dynamic oligopolies (Q4015968) (← links)