Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4116288 / 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: Topological design of computer communication networks -- the overall design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach to the fixed-charge capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based heuristic algorithms for interconnecting token rings via source routing bridges / rank
 
Normal rank

Latest revision as of 16:19, 30 May 2024

scientific article
Language Label Description Also known as
English
Benders-and-cut algorithm for fixed-charge capacitated network design problem
scientific article

    Statements

    Benders-and-cut algorithm for fixed-charge capacitated network design problem (English)
    0 references
    0 references
    0 references
    3 September 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    telecommunication
    0 references
    network design
    0 references
    integer programming
    0 references
    branch and bound
    0 references
    Benders decomposition
    0 references