期刊
DISCRETE OPTIMIZATION
卷 8, 期 2, 页码 246-258出版社
ELSEVIER
DOI: 10.1016/j.disopt.2010.09.003
关键词
Pricing; Bilevel programming; Networks; Column generation; Combinatorial optimization
This work focuses on an improved exact algorithm for addressing an NP-hard network pricing problem. The method involves an efficient and partial generation of candidate solutions, a recursive scheme for generating improved upper bounds, and a column generation procedure for solving the network-structured subproblems. Its efficiency is assessed against both randomly generated instances involving three distinct topologies as well as instances based on real life situations in telecommunication and freight transportation. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据