Optimal solution of the discrete cost multicommodity network design problem (Q2518654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2008.07.031 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Capacitated Multicommodity Networks with Multiple Facilities / 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: Multicommodity network design with discrete node costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of multicommodity network optimization problems with general step cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete cost multicommodity network optimization problems and exact solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to multicommodity survivable network design / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2008.07.031 / rank
 
Normal rank

Latest revision as of 04:29, 19 December 2024

scientific article
Language Label Description Also known as
English
Optimal solution of the discrete cost multicommodity network design problem
scientific article

    Statements

    Optimal solution of the discrete cost multicommodity network design problem (English)
    0 references
    0 references
    0 references
    16 January 2009
    0 references
    network design
    0 references
    synthesis of capacitated networks
    0 references
    multicommodity flows
    0 references
    constraint generation
    0 references

    Identifiers