Congested network flows: Time-varying demands and start-time policies (Q1111459): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Jerzy Kamburowski / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jerzy Kamburowski / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(88)90429-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982755095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Time-Varying Flows on Congested Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Road congestion / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:47, 19 June 2024

scientific article
Language Label Description Also known as
English
Congested network flows: Time-varying demands and start-time policies
scientific article

    Statements

    Congested network flows: Time-varying demands and start-time policies (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The paper acquaints the reader with fundamental assumptions and main results of the theory of flows in congested networks. A general model is analyzed which includes departure time and arrival time patterns of travellers during the morning rush-hour. Two different work-start time policies are considered and illustrated by numerical examples. Some directions for future research are indicated.
    0 references
    Urban traffic
    0 references
    flows in congested networks
    0 references
    rush-hour
    0 references

    Identifiers