| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 473360 | Computers & Operations Research | 2012 | 9 Pages |
Abstract
In this paper, we propose an efficient Tabu Search procedure for solving the NP-hard network pricing problem. By exploiting the problem's features, the algorithm allows the near-optimal solution of problem instances that are out of reach of exact combinatorial methods.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
L. Brotcorne, F. Cirinei, P. Marcotte, G. Savard,