Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2011.05.015 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.05.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059073032 / 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
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: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural model for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration: Two stage solution construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations and solution procedures for the hop constrained network design problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable capacitated network design problem: new formulation and Lagrangean relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation. (With comments and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.05.015 / rank
 
Normal rank

Latest revision as of 09:09, 11 December 2024

scientific article
Language Label Description Also known as
English
Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
scientific article

    Statements

    Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    location
    0 references
    network design
    0 references
    Lagrangean relaxation heuristics
    0 references

    Identifiers