A Tabu search algorithm for the network pricing problem

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.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2012, 39 (11), pp.2603-2611. 〈10.1016/j.cor.2012.01.005〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00759245
Contributeur : Luce Brotcorne <>
Soumis le : vendredi 30 novembre 2012 - 12:22:30
Dernière modification le : lundi 19 mars 2018 - 22:38:02

Identifiants

Citation

Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard. A Tabu search algorithm for the network pricing problem. Computers and Operations Research, Elsevier, 2012, 39 (11), pp.2603-2611. 〈10.1016/j.cor.2012.01.005〉. 〈hal-00759245〉

Partager

Métriques

Consultations de la notice

150