A branch and cut algorithm for the hierarchical network design problem (Q2379520): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2072701932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Algorithm for Multi-Level Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut approach for minimum cost multi-level network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of a Hierarchical Transportation Network with Transshipment Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design problem with transshipment facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing with split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-weighted Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented arborescence formulation for the two-level network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Tier Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design of hierarchical networks with free main path extremes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hierarchical Network Design Problem: A New Formulation and Solution Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A suboptimal solution to a hierarchical network design problem using dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design problem with multiple primary paths / rank
 
Normal rank

Latest revision as of 14:13, 2 July 2024

scientific article
Language Label Description Also known as
English
A branch and cut algorithm for the hierarchical network design problem
scientific article

    Statements

    A branch and cut algorithm for the hierarchical network design problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2010
    0 references
    extensive facility location
    0 references
    cutting planes
    0 references

    Identifiers