Pages that link to "Item:Q1115344"
From MaRDI portal
The following pages link to Optimal product design using conjoint analysis: Computational complexity and algorithms (Q1115344):
Displaying 32 items.
- Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
- Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs (Q439688) (← links)
- Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover (Q513106) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Valid inequalities and branch-and-cut for the clique pricing problem (Q665989) (← links)
- Optimal product line design: genetic algorithm approach to mitigate cannibalization (Q868585) (← links)
- New formulations and valid inequalities for a bilevel pricing problem (Q935200) (← links)
- A pricing problem under Monge property (Q951107) (← links)
- On the product line selection problem under attraction choice models of consumer behavior (Q976431) (← links)
- A model and solution method for multi-period sales promotion design. (Q1406500) (← links)
- A pruning heuristic for use with multisource product design (Q1592736) (← links)
- An efficient solution method to design the cost-minimizing platform portfolio (Q1751801) (← links)
- An evolutionary algorithm approach to the share of choices problem in the product line design (Q1885999) (← links)
- A model of product line design and introduction sequence with reservation utility (Q1926743) (← links)
- Conjoint-based product (line) design considering competitive reactions (Q1976724) (← links)
- Fuzzy self-tuning differential evolution for optimal product line design (Q2024008) (← links)
- Clonal selection algorithms for optimal product line design: a comparative study (Q2076834) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- On envy-free perfect matching (Q2414450) (← links)
- Optimal product design using a colony of virtual ants (Q2432923) (← links)
- Advanced conjoint analysis using feature selection via support vector machines (Q2629697) (← links)
- A polyhedral study of the network pricing problem with connected toll arcs (Q3057150) (← links)
- An Optimization Framework for Product Design (Q3114751) (← links)
- Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem (Q3115965) (← links)
- Optimizing Product Line Designs: Efficient Methods and Comparisons (Q3117744) (← links)
- A Branch-and-Price Approach to the Share-of-Choice Product Line Design Problem (Q3117860) (← links)
- A web-based methodology for product design evaluation and optimisation (Q3157776) (← links)
- Genetic Algorithms for Product Design (Q4363683) (← links)
- Bicriteria product design optimization: An efficient solution procedure using AND/OR trees (Q4785050) (← links)
- Exact First-Choice Product Line Optimization (Q5126626) (← links)
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study (Q5945206) (← links)
- One-stage product-line design heuristics: an empirical comparison (Q6556798) (← links)
