New formulations for two location problems with interconnected facilities (Q6128897): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2023.09.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4387142722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact MILP formulations for the \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rooted Maximum Node-Weight Connected Subgraph Problem / 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: Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Regenerator Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median and covering location problems with interconnected facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree of hubs location problem / 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: Minimizing movement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient Benders decomposition for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter formulation of the \(p\)-median problem / 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: A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large <i>p</i>-Median Problems with a Radius Formulation / 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 simple plant location problem: Survey and synthesis / 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: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems / 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: The connected facility location polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner trees: Recent advances, challenges, and perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / 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: Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Solution of Prize-Collecting Steiner Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximal covering location problem with heuristic concentration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust sensor covering and communication problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for uncapacitated facility location problem with penalties / rank
 
Normal rank

Latest revision as of 13:22, 4 December 2024

scientific article; zbMATH DE number 7833013
Language Label Description Also known as
English
New formulations for two location problems with interconnected facilities
scientific article; zbMATH DE number 7833013

    Statements

    New formulations for two location problems with interconnected facilities (English)
    0 references
    0 references
    0 references
    16 April 2024
    0 references
    combinatorial optimization
    0 references
    discrete location problems
    0 references
    network design
    0 references
    branch-and-cut
    0 references
    benders decomposition
    0 references
    0 references
    0 references
    0 references

    Identifiers