Finding the K shortest hyperpaths using reoptimization-Reference-Cited by-同舟云学术

Finding the K shortest hyperpaths using reoptimization

Published:2006-03 Issue:2 Volume:34 Page:155-164
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Nielsen Lars Relund,Pretolani Daniele,Allan Andersen Kim

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference14 articles.

1. Directed hypergraphs: problems, algorithmic results, and a novel decremental approach;Ausiello;Lecture Notes in Comput. Sci.,2001

2. G. Ausiello, G.F. Italiano, U. Nanni, Optimal traversal of directed hypergraphs, Technical Report TR–92–073, International Computer Science Institute, Berkeley, CA, September 1992.

3. Directed hypergraphs and applications;Gallo;Discrete Appl. Math.,1993

4. A note on minimum makespan assembly plans;Gallo;Euro. J. Oper. Res.,2002

5. Gainfree Leontief substitution flow problems;Jeroslow;Mathem. Program.,1992

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process;International Transactions in Operational Research;2021-05-04

2. Understanding the complexity of axiom pinpointing in lightweight description logics;Artificial Intelligence;2017-09

3. Multimodal Transport Network Problem: Classical and Innovative Approaches;Soft Computing for Sustainability Science;2017-07-14

4. Ranking paths in stochastic time-dependent networks;European Journal of Operational Research;2014-08

5. On the Complexity of Strongly Connected Components in Directed Hypergraphs;Algorithmica;2013-01-04