The following pages link to full work available at URL (P205):
Displaying 50 items.
- A more efficient second order blind identification method for separation of uncorrelated stationary time series (Q297132) (← links)
- On uniform nonintegrability for a sequence of random variables (Q297134) (← links)
- On bounding the union probability using partial weighted information (Q297136) (← links)
- On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence (Q297140) (← links)
- Characteristic function of time-inhomogeneous Lévy-driven Ornstein-Uhlenbeck processes (Q297142) (← links)
- An arctangent law (Q297143) (← links)
- An exact Kolmogorov-Smirnov test for whether two finite populations are the same (Q297145) (← links)
- Robust nonparametric kernel regression estimator (Q297148) (← links)
- Optimal two-level designs for partial profile choice experiments (Q297151) (← links)
- Artifactual unit root behavior of value at risk (VaR) (Q297153) (← links)
- Asymmetric risk of the Stein variance estimator under a misspecified linear regression model (Q297155) (← links)
- Pitman closeness properties of point estimators and predictive densities with parametric constraints (Q297158) (← links)
- Optimal designs for regression models with autoregressive errors (Q297159) (← links)
- A maximum principle for the stochastic variational inequalities (Q297162) (← links)
- A solution to the reversible embedding problem for finite Markov chains (Q297164) (← links)
- When Markov chains meet: a continuous-time model of network evolution (Q297166) (← links)
- Large and moderate deviations for a renewal randomly indexed branching process (Q297168) (← links)
- Fractional spherical random fields (Q297169) (← links)
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- Two-stage stochastic linear programs with incomplete information on uncertainty (Q297173) (← links)
- On distributional robust probability functions and their computations (Q297175) (← links)
- A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Optimal single machine scheduling of products with components and changeover cost (Q297186) (← links)
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- Pooling of spare parts between multiple users: how to share the benefits? (Q297192) (← links)
- Competition for cores in remanufacturing (Q297196) (← links)
- Product variety and channel structure strategy for a retailer-Stackelberg supply chain (Q297198) (← links)
- A multi-objective approach to supply chain visibility and risk (Q297200) (← links)
- Revenue deficiency under second-price auctions in a supply-chain setting (Q297202) (← links)
- A scenario-based stochastic model for supplier selection in global context with multiple buyers, currency fluctuation uncertainties, and price discounts (Q297206) (← links)
- Public policy structuring incorporating reciprocal expectation analysis (Q297210) (← links)
- Portfolio optimization in a regime-switching market with derivatives (Q297212) (← links)
- Optimal two-phase vaccine allocation to geographically different regions under uncertainty (Q297216) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem (Q297221) (← links)
- Stochastic models for strategic resource allocation in nonprofit foreclosed housing acquisitions (Q297222) (← links)
- Pricing and market segmentation using opaque selling mechanisms (Q297225) (← links)
- Two-stage financial risk tolerance assessment using data envelopment analysis (Q297229) (← links)
- Should retail stores also RFID-tag `cheap' items? (Q297233) (← links)
- Coding techniques for handling failures in large disk arrays (Q297238) (← links)
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- MIP models for resource-constrained project scheduling with flexible resource profiles (Q297247) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Qualifying for a government's scrappage program to stimulate consumers' trade-in transactions? Analysis of an automobile supply chain involving a manufacturer and a retailer (Q297253) (← links)
- Make-or-buy service capacity decision in a supply chain providing after-sales service (Q297258) (← links)
- Reciprocal supply chain with intention (Q297263) (← links)
