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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of applied and industrial mathematics Jg. 8; H. 4; S. 574 - 581
Hauptverfasser:	Panin, A. A., Plyasunov, A. V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.10.2014 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!