Multiperiod network design with incremental routing (Q3593377): 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.1002/net.20171 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4235818304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Extreme Rays of the Metric Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank

Latest revision as of 12:37, 26 June 2024

scientific article
Language Label Description Also known as
English
Multiperiod network design with incremental routing
scientific article

    Statements

    Multiperiod network design with incremental routing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multiperiod network design
    0 references
    integer programming
    0 references
    incremental flow
    0 references
    polyhedral study
    0 references
    extreme rays
    0 references
    0 references