Finding the K shortest hyperpaths

详细信息    查看全文

• 作者：Nielsen ; Lars Relund ; Andersen ; Kim Allan ; Pretolani ; Daniele
• 关键词：Network programming ; Directed hypergraphs ; K shortest hyperpaths ; K shortest paths
• 刊名：Computers and Operations Research
• 出版年：2005
• 出版时间：June, 2005
• 年：2005
• 卷：32
• 期：6
• 页码：1477-1497
• 全文大小：317 K

文摘

The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However, the K shortest hyperpaths problem has not yet been investigated.