Complexity of Product Positioning and Ball Intersection Problems

DOI10.1287/MOOR.20.4.885MaRDI QIDQ4881515zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Brigitte Jaumard, Yves Crama

Publication date 9 June 1996

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.20.4.885

zbMATH Keywords

product positioning problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Marketing, advertising (90B60) Discrete location and assignment (90B80) Applications of mathematical programming (90C90)

Recommendations

• New algorithms for product positioning
• A Variable-Complexity Norm Maximization Problem
• Optimal product design using conjoint analysis: Computational complexity and algorithms
• Hitting or avoiding balls in Euclidean space
• The problem of a minimal ball enclosing k points

Cited in

(3)

• New algorithms for product positioning
• Competitive location and pricing on a line with metric transportation costs
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Complexity of Product Positioning and Ball Intersection Problems

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