Scheduling Promotion Vehicles to Boost Profits

References

• Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1–2):123–134.Crossref, Google Scholar
• Arkin EM, Hassin R (1998) On local search for weighted k-set packing. Math. Oper. Res. 23(3):640–648.Link, Google Scholar
• Berman P (2000) A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. Comput. 7(3):178–184.Google Scholar
• Berman P, Fujito T (1999) On approximation properties of the independent set problem for low degree graphs. Theory Comput. Systems 32(2):115–132.Crossref, Google Scholar
• Berstein Y, Onn S (2008) Nonlinear bipartite matching. Discrete Optim. 5(1):53–65.Crossref, Google Scholar
• Berstein Y, Lee J, Maruri-Aguilar H, Onn S, Riccomagno E, Weismantel R, Wynn H (2008) Nonlinear matroid optimization and experimental design. SIAM J. Discrete Math. 22(3):901–919.Crossref, Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization Over Integers, Vol. 13 (Dynamic Ideas, Belmont, MA).Google Scholar
• Blattberg RC, Neslin SA (1990) Sales Promotion: Concepts, Methods and Strategies (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. Du D-Z, Pardalos PM, eds. Handbook of Combinatorial Optimization (Springer, New York), 1–74.Crossref, Google Scholar
• Campo K, Gijsbrechts E, Nisol P (2000) Towards understanding consumer response to stock-outs. J. Retailing 76(2):219–242.Crossref, Google Scholar
• Caro F, Gallien J (2010) Inventory management of a fast-fashion retail network. Oper. Res. 58(2):257–273.Link, Google Scholar
• Chandra B, Halldorsson MM (2001) Greedy local improvement and weighted set packing approximation. J. Algorithms 39(2):223–240.Crossref, Google Scholar
• Chandrasekaran R, Kabadi SN, Murthy KG (1982) Some NP-complete problems in linear programming. Oper. Res. Lett. 1(3):101–104.Crossref, Google Scholar
• Chen X, Simchi-Levi D (2004) Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The infinite horizon case. Math. Oper. Res. 29(3):698–723.Link, Google Scholar
• Cohen MC, Leung N-HZ, Panchamgam K, Perakis G, Smith A (2017) The impact of linear optimization on promotion planning. Oper. Res. 65(2):446–468.Link, Google Scholar
• Cooper LG, Baron P, Levy W, Swisher M, Gogos P (1999) Promocast: A new forecasting method for promotion planning. Marketing Sci. 18(3):301–316.Link, Google Scholar
• Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to Algorithms, 3rd Ed. (MIT Press, Cambridge, MA).Google Scholar
• Corsten D, Gruen T (2004) Stock-outs cause walkouts. Harvard Bus. Rev. 82(5):26–28.Google Scholar
• Foekens EW, Leeflang PSH, Wittink DR (1998) Varying parameter models to accommodate dynamic promotion effects. J. Econometrics 89(1):249–268.Crossref, Google Scholar
• Gutin G (2013) Independence and cliques. Gross JL, Yellen J, Zhang P, eds. Handbook of Graph Theory, 2nd Ed. Discrete Mathematics and Its Applications (CRC Press, Boca Raton, FL),475–489.Crossref, Google Scholar
• Halldórsson MM, Yoshihara K (1995) Greedy approximations of independent sets in low degree graphs. Proc. 6th Internat. Sympos. Algorithms Comput., 152–161.Google Scholar
• Hassin R, Tamir A (1989) Maximizing classes of two-parameter objectives over matroids. Math. Oper. Res. 14(2):362–375.Link, Google Scholar
• Håstad J (1996) Clique is hard to approximate within n1−ε. Proc. 37th Annual Sympos. Foundations Comput. Sci., 627–636.Google Scholar
• Hazan E, Safra S, Schwartz O (2006) On the complexity of approximating k-set packing. Computational Complexity 15(1):20–39.Crossref, Google Scholar
• Heilman CM, Nakamoto K, Rao AG (2002) Pleasant surprises: Consumer response to unexpected in-store coupons. J. Marketing Res. 39(2):242–252.Crossref, Google Scholar
• Hemmecke R, Köppe M, Lee J, Weismantel R (2010) Nonlinear integer programming. Jünger M, Liebling ThM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA, eds. 50 Years of Integer Programming 1958–2008 (Springer, Berlin), 561–618.Crossref, Google Scholar
• Hochbaum DS (2007) Complexity and algorithms for nonlinear optimization problems. Ann. Oper. Res. 153(1):257–296.Crossref, Google Scholar
• Kleinberg J, Tardos É (2005) Algorithm Design (Addison-Wesley, Boston).Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2008) Assortment planning: Review of literature and industry practice. Agrawal N, Smith S, eds. Retail Supply Chain Management (Springer, New York),99–153.Crossref, Google Scholar
• Köppe M (2012) On the complexity of nonlinear mixed-integer optimization. Lee J, Leyffer S, eds. Mixed Integer Nonlinear Programming (Springer, New York), 533–557.Crossref, Google Scholar
• Lee J, Onn S, Weismantel R (2009) Approximate nonlinear optimization over weighted independence systems. SIAM J. Discrete Math. 23(4):1667–1681.Crossref, Google Scholar
• Macé S, Neslin SA (2004) The determinants of pre- and postpromotion dips in sales of frequently purchased goods. J. Marketing Res. 41(3):339–350.Crossref, Google Scholar
• Mulmuley K, Vazirani UV, Vazirani VV (1987) Matching is as easy as matrix inversion. Combinatorica 7(1):105–113.Crossref, Google Scholar
• Onn S (2003) Convex matroid optimization. SIAM J. Discrete Math. 17(2):249–253.Crossref, Google Scholar
• Papadimitriou CH (1984) Polytopes and complexity. Pulleyblank WR, ed. Progress in Combinatorial Optimization (Academic Press, Orlando, FL), 295–305.Crossref, Google Scholar
• Papadimitriou CH, Yannakakis M (1982) The complexity of restricted spanning tree problems. J. ACM 29(2):285–309.Crossref, Google Scholar
• Pardalos PM, Xue J (1994) The maximum clique problem. J. Global Optim. 4(3):301–328.Crossref, Google Scholar
• Phillips RL (2005) Pricing and Revenue Optimization (Stanford University Press, Stanford, CA).Crossref, Google Scholar
• Schrijver A (1998) Theory of Linear and Integer Programming (Wiley-Interscience, Chichester, UK).Google Scholar
• Talluri KT, van Ryzin GJ (2004) The Theory and Practice of Revenue Management (Springer Science+Business Media, New York).Crossref, Google Scholar
• The Reinvestment Fund (2011) Understanding the grocery industry. https://www.reinvestment.com/wp-content/uploads/2015/12/Understanding_the_Grocery_Industry-Brief_2011.pdf.Google Scholar
• Van Donselaar K, van Woensel T, Broekmeulen R, Fransoo J (2006) Inventory control of perishables in supermarkets. Internat. J. Production Econom. 104(2):462–472.Crossref, Google Scholar
• Van Heerde HJ, Leeflang PSH, Wittink DR (2000) The estimation of pre- and postpromotion dips with store-level scanner data. J. Marketing Res. 37:383–395.Crossref, Google Scholar
• Williamson DP, Shmoys DB (2010) The Design of Approximation Algorithms (Cambridge University Press, New York).Google Scholar
• Wittink DR, Addona MJ, Hawkes WJ, Porter JC (1988) SCAN*PRO: The estimation, validation and use of promotional effects based on scanner data. Internal paper, Cornell University.Google Scholar
• Wolsey LA, Nemhauser GL (1999) Integer and Combinatorial Optimization (Wiley-Interscience, New York).Google Scholar
• Yi T, Murty KG, Spera C (2002) Matchings in colored bipartite networks. Discrete Appl. Math. 121(1–3):261–277.Crossref, Google Scholar