Solving min-max shortest-path problems on a network (Q4018281): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Solving min-max shortest-path problems on a network
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Stabilization of Linear Diffusion Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001824 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/1520-6750(199208)39:5<669::aid-nav3220390506>3.0.co;2-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155090062 / rank
 
Normal rank
Property / title
 
Solving min-max shortest-path problems on a network (English)
Property / title: Solving min-max shortest-path problems on a network (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving min-max shortest-path problems on a network
scientific article

    Statements

    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    routing
    0 references
    multiobjective shortest-path problems
    0 references
    label-correcting procedure
    0 references
    pruning
    0 references
    0 references
    Solving min-max shortest-path problems on a network (English)
    0 references