Geodesic
The pricing problem. Part~I. Exact and approximate algorithms
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 5, pp. 83-100

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the mill pricing problem which is shown to be NP-hard in the strong sense. To solve this problem, some exact and approximate algorithms based on decomposition, genetic local search, and tabu search are developed. Results of the computing experiments are given. Tab. 3, bibliogr. 25.
Keywords: NP-hard in the strong sense, the bilevel pricing problem, minimax problem, local search, tabu search, genetic algorithm, hybrid algorithm.
Mots-clés : decomposition 
@article{DA_2012_19_5_a5,
     author = {A. V. Plyasunov and A. A. Panin},
     title = {The pricing problem. {Part~I.} {Exact} and approximate algorithms},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {83--100},
     publisher = {mathdoc},
     volume = {19},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_5_a5/}
}
TY  - JOUR
AU  - A. V. Plyasunov
AU  - A. A. Panin
TI  - The pricing problem. Part~I. Exact and approximate algorithms
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 83
EP  - 100
VL  - 19
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_5_a5/
LA  - ru
ID  - DA_2012_19_5_a5
ER  - 
%0 Journal Article
%A A. V. Plyasunov
%A A. A. Panin
%T The pricing problem. Part~I. Exact and approximate algorithms
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 83-100
%V 19
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_5_a5/
%G ru
%F DA_2012_19_5_a5
A. V. Plyasunov; A. A. Panin. The pricing problem. Part~I. Exact and approximate algorithms. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 5, pp. 83-100. http://geodesic.mathdoc.fr/item/DA_2012_19_5_a5/