Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2018.12.021 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2906524013 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62048251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradual covering decay location problem on a network. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Facet'' separation with one linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation effects in maximum covering models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition without separability: a computational study for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the maximal covering location problem / 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: Location Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches to the single-source network loading problem / 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: Intelligent-guided adaptive search for the maximum covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility siting and integer-friendly programming / 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 decomposition heuristic for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous space maximal coverage: insights, advances and challenges / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2018.12.021 / rank
 
Normal rank

Revision as of 05:55, 11 December 2024

scientific article
Language Label Description Also known as
English
Benders decomposition for very large scale partial set covering and maximal covering location problems
scientific article

    Statements

    Benders decomposition for very large scale partial set covering and maximal covering location problems (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2019
    0 references
    combinatorial optimization
    0 references
    location problems
    0 references
    covering
    0 references
    Benders decomposition
    0 references
    branch-and-cut algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers