000086445 001__ 86445
000086445 005__ 20230728141553.0
000086445 0247_ $$2doi$$a10.1016/j.cor.2018.12.011
000086445 0248_ $$2sideral$$a110351
000086445 037__ $$aART-2019-110351
000086445 041__ $$aeng
000086445 100__ $$0(orcid)0000-0001-7603-9380$$aCalvete, H.I.$$uUniversidad de Zaragoza
000086445 245__ $$aThe rank pricing problem: Models and branch-and-cut algorithms
000086445 260__ $$c2019
000086445 5060_ $$aAccess copy available to the general public$$fUnrestricted
000086445 5203_ $$aOne of the main concerns in management and economic planning is to sell the right product to the right customer for the right price. Companies in retail and manufacturing employ pricing strategies to maximize their revenues. The Rank Pricing Problem considers a unit-demand model with unlimited supply and uniform budgets in which customers have a rank-buying behavior. Under these assumptions, the problem is first analyzed from the perspective of bilevel pricing models and formulated as a non linear bilevel program with multiple independent followers. We also present a direct non linear single level formulation bearing in mind the aim of the problem. Two different linearizations of the models are carried out and two families of valid inequalities are obtained which, embedded in the formulations by implementing a branch-and-cut algorithm, allow us to tighten the upper bound given by the linear relaxation of the models. We also study the polyhedral structure of the models, taking advantage of the fact that a subset of their constraints constitutes a special case of the Set Packing Problem, and characterize all the clique facets. Besides, we develop a preprocessing procedure to reduce the size of the instances. Finally, we show the efficiency of the formulations, the branch-and-cut algorithms and the preprocessing through extensive computational experiments.
000086445 536__ $$9info:eu-repo/grantAgreement/ES/MINECO/ECO2016-76567-C4-3-R
000086445 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/
000086445 590__ $$a3.424$$b2019
000086445 591__ $$aOPERATIONS RESEARCH & MANAGEMENT SCIENCE$$b21 / 83 = 0.253$$c2019$$dQ2$$eT1
000086445 591__ $$aCOMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS$$b34 / 109 = 0.312$$c2019$$dQ2$$eT1
000086445 591__ $$aENGINEERING, INDUSTRIAL$$b14 / 48 = 0.292$$c2019$$dQ2$$eT1
000086445 592__ $$a1.663$$b2019
000086445 593__ $$aComputer Science (miscellaneous)$$c2019$$dQ1
000086445 593__ $$aModeling and Simulation$$c2019$$dQ1
000086445 593__ $$aManagement Science and Operations Research$$c2019$$dQ1
000086445 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion
000086445 700__ $$aDomínguez, C.
000086445 700__ $$0(orcid)0000-0002-5630-3719$$aGalé, C.$$uUniversidad de Zaragoza
000086445 700__ $$aLabbé, M.
000086445 700__ $$aMarín, A.
000086445 7102_ $$12007$$2265$$aUniversidad de Zaragoza$$bDpto. Métodos Estadísticos$$cÁrea Estadís. Investig. Opera.
000086445 773__ $$g105 (2019), 12-31$$pComput. oper. res.$$tComputers and Operations Research$$x0305-0548
000086445 8564_ $$s984392$$uhttps://zaguan.unizar.es/record/86445/files/texto_completo.pdf$$yPostprint
000086445 8564_ $$s200877$$uhttps://zaguan.unizar.es/record/86445/files/texto_completo.jpg?subformat=icon$$xicon$$yPostprint
000086445 909CO $$ooai:zaguan.unizar.es:86445$$particulos$$pdriver
000086445 951__ $$a2023-07-28-11:55:54
000086445 980__ $$aARTICLE