The incremental connected facility location problem (Q2329719): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2019.104763 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The multi-period incremental service facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the set union knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP Modeling of Incremental Connected Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network construction problems with due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Based Local Search for the Connected Facility Location and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian decompositions for the two-level FTTx network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal expansion of an existing network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition for very large scale partial set covering and maximal covering location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Network Capacity Planning: A Shortest-Path Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected facility location via random facility sampling and core detouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Network Design with Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP models for connected facility location: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Push Tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with maximum flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of tree-star problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut-and-price for capacitated connected facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic facility location: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On building minimum cost communication networks over time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2019.104763 / rank
 
Normal rank

Latest revision as of 01:06, 18 December 2024

scientific article
Language Label Description Also known as
English
The incremental connected facility location problem
scientific article

    Statements

    The incremental connected facility location problem (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2019
    0 references
    mixed integer programming
    0 references
    facility location
    0 references
    branch-and-cut
    0 references
    multi-period network design
    0 references
    incremental network design
    0 references
    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