EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"K shortest paths"
Narrow search

Narrow search

Year of publication
Subject
All
K shortest paths 3 Business network 1 Constrained shortest paths 1 Directed hypergraphs 1 Graph theory 1 Graphentheorie 1 K shortest hyperpaths 1 K shortest paths algorithm 1 Multi-route planning 1 Multimodal transportation 1 Network 1 Network programming 1 Netzplantechnik 1 Netzwerk 1 Oversize and heavyweight cargo (OHC) 1 Project network techniques 1 Reconstruction of lines and nodes 1 Shortest paths 1 Time-constrained network 1 Time-schedule network 1 Unternehmensnetzwerk 1 call routing 1 directed hypergraphs 1 k-shortest paths 1 routing 1 stochastic time-dependent networks 1 tabu search 1
more ... less ...
Online availability
All
Undetermined 2
Type of publication
All
Article 3 Book / Working Paper 2
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
Undetermined 3 English 2
Author
All
Andersen, Kim Allan 2 Nielsen, Lars Relund 2 Pretolani, Daniele 2 Chen, Shuiping 1 Glover, Fred 1 Huang, Jiaxiao 1 Jiang, Hai 1 Jin, Wen 1 Laguna, Manuel 1 Luo, Yan 1 Yang, Huiyu 1 Zhang, Yinggui 1
more ... less ...
Institution
All
Ehrvervøkonomisk Institut, Institut for Økonomi 2
Published in...
All
CORAL Working Papers 2 Computers & operations research : and their applications to problems of world concern ; an international journal 2 Management Science 1
Source
All
RePEc 3 ECONIS (ZBW) 2
Showing 1 - 5 of 5
Cover Image
Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
Luo, Yan; Zhang, Yinggui; Huang, Jiaxiao; Yang, Huiyu - In: Computers & operations research : and their … 128 (2021), pp. 1-13
Persistent link: https://www.econbiz.de/10012439861
Saved in:
Cover Image
Finding the K shortest paths in a time-schedule network with constraints on arcs
Jin, Wen; Chen, Shuiping; Jiang, Hai - In: Computers & operations research : and their … 40 (2013) 12, pp. 2975-2982
Persistent link: https://www.econbiz.de/10010210736
Saved in:
Cover Image
K shortest paths in stochastic time-dependent networks
Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim … - Ehrvervøkonomisk Institut, Institut for Økonomi - 2004
shortest paths. Moreover, we present a computational comparison of time-adaptive and a priori route choices, pointing out the … solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K …
Persistent link: https://www.econbiz.de/10005802221
Saved in:
Cover Image
Finding the K shortest hyperpaths using reoptimization
Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim … - Ehrvervøkonomisk Institut, Institut for Økonomi - 2004
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve...
Persistent link: https://www.econbiz.de/10005802236
Saved in:
Cover Image
Bandwidth Packing: A Tabu Search Approach
Laguna, Manuel; Glover, Fred - In: Management Science 39 (1993) 4, pp. 492-500
The bandwidth packing (BWP) problem is a combinatorially difficult problem arising in the area of telecommunications. The problem consists of assigning calls to paths in a capacitated graph, such that capacities are not violated and the total profit is maximized. In this paper we discuss the...
Persistent link: https://www.econbiz.de/10009213983
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...