Mass Customization and “Forecasting Options’ Penetration Rates Problem”

DOI10.1287/opre.2018.1795zbMath1444.90010OpenAlexW2945476268MaRDI QIDQ5129183

Sriram Dasu, Ali Fattahi, Reza H. Ahmadi

Publication date: 26 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2018.1795

zbMATH Keywords

forecastingsupply chainmass customizationFrank-Wolfeprobabilistic satisfiability

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)

Related Items (1)

The Weighted Nonnegative Least-Squares Problem with Implicitly Characterized Points

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assortment selection and pricing for configurable products under demand uncertainty
• Compact normal forms in propositional logic and integer programming formulations
• Probabilistic satisfiability
• Tight representation of logical constraints as cardinality rules
• A linear programming approach to reasoning about probabilities
• Probabilistic satisfiability with imprecise probabilities
• Counting models for 2SAT and 3SAT formulae
• Probabilistic logic revisited
• Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability
• Learning with Submodular Functions: A Convex Optimization Perspective
• Consistency restoration and explanations in dynamic CSPs---Application to configuration

This page was built for publication: Mass Customization and “Forecasting Options’ Penetration Rates Problem”