.png){kind=icon}
.png){kind=icon}
Return
A Tabu search algorithm for the network pricing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.01.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Tabu Search
Pricing problem on network
Combinatorial optimization
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W