Algorithms for time-dependent bicriteria shortest path problems (Q2465939): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2006.05.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020257725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic shortest paths minimizing travel times and costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical investigation of some bicriterion shortest path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in networks with vector weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria optimization: State of the art annotated bibliographic surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependency in multiple objective dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight paths in time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-Time Shortest Path Problems and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite-time algorithm for shortest path problems with time-varying costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow approach to a city emergency evacuation planning / rank
 
Normal rank

Latest revision as of 15:01, 27 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for time-dependent bicriteria shortest path problems
scientific article

    Statements

    Algorithms for time-dependent bicriteria shortest path problems (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    multiple criteria optimization
    0 references
    label setting algorithm
    0 references
    time-dependent shortest path problem
    0 references
    bicriteria shortest path problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references