On complexity of the bilevel location and pricing problems

We consider the bilevel mixed integer location and pricing problems. Each problem is determined by the optimization problems of the upper and lower levels of which the first describes the choice of location and pricing, while the second models the reaction of the customers on the upper-level solutio...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of applied and industrial mathematics Ročník 8; číslo 4; s. 574 - 581
Hlavní autoři:	Panin, A. A., Plyasunov, A. V.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.10.2014 Springer Nature B.V
Témata:	Complexity Customers Integer programming Manufacturers Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Mills Mixed integer Optimization Prices Pricing Pricing policies Strategy Studies Poly-APX-completeness AP-reducibility bilevel problem computational complexity and approximation complexity location NP-hardness in the strong sense pricing
ISSN:	1990-4789, 1990-4797
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!