New algorithms for product positioning

DOI10.1016/S0377-2217(96)00338-4zbMath0955.91020OpenAlexW2073863303MaRDI QIDQ1291641

Brigitte Jaumard, Pierre Hansen, Christophe Meyer, Jacques-François Thisse

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00338-4

zbMATH Keywords

marketingproduct positioningbranch-and-bound methodsball intersectionindifference surface

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (2)

Location Science in Canada ⋮ Static competitive facility location: an overview of optimisation approaches.

Cites Work

• Issues and advances in product positioning models in marketing research
• NICHER: An approach to identifying defensible product positions
• A procedure for new product positioning in an attribute space
• An extended algorithm for optimal product positioning
• An Approach to the Optimal Positioning of a New Product
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• The Attribute-Dynamic Attitude Model (Adam)
• ZIPMAP -- A Zero-One Integer Programming Model for Market Segmentation and Product Positioning
• Complexity of Product Positioning and Ball Intersection Problems

This page was built for publication: New algorithms for product positioning