Pages that link to "Item:Q3115965"
From MaRDI portal
The following pages link to Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem (Q3115965):
Displaying 14 items.
- Political engineering: optimizing a U.S. Presidential candidate's platform (Q744671) (← links)
- Bayesian coverage optimization models (Q965815) (← links)
- On the product line selection problem under attraction choice models of consumer behavior (Q976431) (← links)
- Optimal product design using conjoint analysis: Computational complexity and algorithms (Q1115344) (← links)
- Share-of-surplus product line optimisation with price levels (Q1718255) (← links)
- Fuzzy self-tuning differential evolution for optimal product line design (Q2024008) (← links)
- Using hierarchical Bayes draws for improving shares of choice predictions in conjoint simulations: a study based on conjoint choice data (Q2242265) (← links)
- A Stackelberg-Nash model for new product design (Q2267376) (← links)
- Advanced conjoint analysis using feature selection via support vector machines (Q2629697) (← links)
- Integrating supplier selection in optimal product family design (Q3019219) (← links)
- An Optimization Framework for Product Design (Q3114751) (← links)
- Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis (Q3116736) (← links)
- A Branch-and-Price Approach to the Share-of-Choice Product Line Design Problem (Q3117860) (← links)
- One-stage product-line design heuristics: an empirical comparison (Q6556798) (← links)
