A Benders decomposition based framework for solving cable trench problems (Q1652230): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56524095, #quickstatements; #temporary_batch_1712688784189
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design / 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: On implementing push-relabel method for the maximum flow problem / 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: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to capacitated \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cable trench problem: Combining the shortest path and minimum spanning tree problems / rank
 
Normal rank

Revision as of 02:09, 16 July 2024

scientific article
Language Label Description Also known as
English
A Benders decomposition based framework for solving cable trench problems
scientific article

    Statements

    A Benders decomposition based framework for solving cable trench problems (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    location
    0 references
    network design
    0 references
    Benders decomposition
    0 references
    integer linear programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references