A. V. Plyasunov, A. A. Panin, “The pricing problem. Part I. Exact and approximate algorithms”, Diskretn. Anal. Issled. Oper., 2012, Volume 19, Issue 5,Pages <nobr>83

This article is cited in 17 papers

The pricing problem. Part I. Exact and approximate algorithms

A. V. Plyasunov^ab, A. A. Panin^ab

^a Novosibirsk State University, Novosibirsk, Russia
^b Sobolev Institute of Mathematics, Novosibirsk, Russia

Abstract: 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, decomposition, local search, tabu search, genetic algorithm, hybrid algorithm.

UDC: 519.87+519.854

Received: 01.06.2011
Revised: 04.06.2012