scientific article; zbMATH DE number 1985662

MaRDI QIDQ4429360zbMATH OpenFDO

Authors V. T. Dement'ev, Yuriy V. Shamardin

Publication date 25 September 2003

zbMATH Keywords

complexityfacility locationpolynomially solvable caseoptimal consumer choice

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 6004856
• The pricing problem. I: Exact and approximate algorithms
• Buying cheap is expensive: approximability of combinatorial pricing problems
• The pricing problem. Part II: Computational complexity
• On the complexity of the highway pricing problem

Cited in

(5)

• Algorithms for marketing-mix optimization
• The pricing problem. I: Exact and approximate algorithms
• Optimization of the pricing of on-line journals
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• Bilevel optimization: theory, algorithms, applications and a bibliography

This page was built for publication:

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