A partitioning algorithm for the network loading problem (Q2654332): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118661425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / 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: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source sink flows with capacity installation in batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank

Latest revision as of 09:48, 2 July 2024

scientific article
Language Label Description Also known as
English
A partitioning algorithm for the network loading problem
scientific article

    Statements

    A partitioning algorithm for the network loading problem (English)
    0 references
    0 references
    0 references
    15 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    network loading problem
    0 references
    Benders partitioning
    0 references
    ACCPM
    0 references
    0 references