Mass customization and ``forecasting options' penetration rates problem

DOI10.1287/OPRE.2018.1795MaRDI QIDQ5129183zbMATH OpenOpenAlexFDO

Authors Ali Fattahi, Sriram Dasu, Reza 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)

Recommendations

• Exact and asymptotically exact solutions for a class of assortment problems
• An inventory model for delayed customization: a hybrid approach
• Production Planning of Style Goods with High Setup Costs and Forecast Revisions
• MULTI-ITEM PRODUCTION PLANNING AND MANAGEMENT SYSTEM BASED ON UNFULFILLED ORDER RATE IN SUPPLY CHAIN
• New formulations for choice network revenue management

Cites work

• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• scientific article; zbMATH DE number 3345848 (Why is no real title available?)
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
• A linear programming approach to reasoning about probabilities
• Assortment selection and pricing for configurable products under demand uncertainty
• Compact normal forms in propositional logic and integer programming formulations
• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Counting models for 2SAT and 3SAT formulae
• Dynamic assortment with demand learning for seasonal consumer goods
• Learning with submodular functions: a convex optimization perspective
• Probabilistic logic revisited
• Probabilistic satisfiability
• Probabilistic satisfiability with imprecise probabilities
• Solutions for hard and soft constraints using optimized probabilistic satisfiability
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Tight representation of logical constraints as cardinality rules

Cited in

(1)

• The Weighted Nonnegative Least-Squares Problem with Implicitly Characterized Points

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Mass customization and ``forecasting options' penetration rates problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129183)