Price strategy implementation

Computers and Operations Research

Volumn 38, Issue 2, 2011, Pages 420-426

  Berger, André ^a   Grigoriev, Alexander ^a   Van Loon, Joyce ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Computational complexity; Local search; Mixed integer program; Pricing problems

Indexed keywords

CONTRACT PRICES; DYNAMIC PROGRAMS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MIXED INTEGER PROGRAMMING; MIXED-INTEGER PROGRAMS; POLYNOMIAL-TIME ALGORITHMS; PRICE STRATEGIES; PRICING PROBLEMS; PRICING STRATEGY; SET OF CUSTOMERS; SINGLE-STEP; TIME HORIZONS; TIME-PERIODS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; ECONOMICS; INDUSTRY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; SALES;

COSTS;

EID: 77956419214     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.06.010     Document Type: Article

References (15)

1. Aggarwal G, Feder T, Motwani R, Zhu A. Algorithms for multi-product pricing. In: Daz J, Karhumki J, Lepist A, Sannella D, editors. Automata, languages and programming ICALP 2004. Lecture notes in computer science, vol. 3142. Springer; 2004. p. 7283.
2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network flows 1993 Prentice-Hall New Jersey
3. L.J. Alvarez-Vzquez, E. Balsa-Canto, and A. Martnez Optimal design and operation of a wastewater purification system Math Comput Simul 79 3 2008 668 682
4. Balcan MF, Blum A. Approximation algorithms and online mechanisms for item pricing. In: Proceedings of the seventh ACM conference on electronic commerce. ACM; 2006. p. 2935.
5. S. Balku, M. Yuceer, and R. Berber Control vector parameterization approach in optimization of alternating aerobic-anoxic systems Optim Control Appl Methods 30 6 2009 573 584
6. J.T. Betts Survey of numerical methods for trajectory optimization J Guidance Control Dyn 21 2 1998 193 207
7. J.T. Betts Practical methods for optimal control using nonlinear programming 2001 SIAM Press Philadelphia
8. Briest P, Krysta P. Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the 17th annual ACMSIAM symposium on discrete algorithms. ACMSIAM; 2006. p. 10931102.
9. Demaine ED, Feige U, Hajiaghayi MT, Salavatipour MR. Combination can be hard: approximability of the unique coverage problem. In: Proceedings of the 17th annual ACMSIAM symposium on discrete algorithms. ACMSIAM; 2006. p. 16271.
10. Elbassioni K, Sitters R, Zhang Y. A quasi-ptas for profit-maximizing pricing on line graphs. In: Arge L, Welzl E, editors. Proceedings of the 15th annual European symposium on algorithms. Lecture notes in computer science, vol. 4698. Springer; 2007, p. 45162.
11. Grigoriev A, van Loon J, Sitters R, Uetz M. Optimal pricing of capacitated networks 2009;53(1):7987.
12. Grigoriev A, van Loon J, Sviridenko M, Uetz M, Vredeveld T. Bundle pricing with comparable items. In: Arge L, Hoffmann M, Welzl E, editors. ESA 2007. Lecture notes in computer science, vol. 4698. Springer; 2007. p. 47586.
13. Guruswami V, Hartline JD, Karlin AR, Kempe D, Kenyon C, McSherry F. On profit-maximizing envy-free pricing. In: Proceedings of the 16th annual ACMSIAM symposium on discrete algorithms. ACMSIAM; 2005. pp. 116473.
14. Hartline JD, Koltun V. Near-optimal pricing in near-linear time. In: Dehne FKHA, Lpez-Ortiz A, Sack J-R, editors. Algorithms and data structuresWADS 2005. Lecture notes in computer sciences, vol. 3608. Springer; 2005. p. 42231.
15. Hirmajer T, Fikar M, Balsa-Canto E, Banga JR. Application of a control vector parameterization method using an interior point algorithm. In: MIC '08: proceedings of the 27th IASTED international conference on modelling, identification and control. Anaheim, CA, USA: ACTA Press; 2008. p. 1227.