Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Geraldo Robson Mateus / rank
Normal rank
 
Property / author
 
Property / author: Geraldo Robson Mateus / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971321306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Designing Hierarchical Survivable Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design 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: The multi-weighted Steiner tree problem: A reformulation by intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations for the two 4-hop-constrained paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for the hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point stabilization for column generation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:18, 12 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-price algorithm for the resilient multi-level hop-constrained network design
scientific article

    Statements

    Branch-and-price algorithm for the resilient multi-level hop-constrained network design (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    branch-and-price
    0 references
    multi-level
    0 references
    resilience
    0 references
    hop-constrained
    0 references
    0 references