Formulation and algorithms for the robust maximal covering location problem (Q1742214): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q486395
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2018.01.016 / rank
Normal rank
 
Property / author
 
Property / author: Amadeu Almeida Coco / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2018.01.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794175087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of obnoxious facilities to locate within a bounded region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs / 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: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted robust uniform matroid maximization under interval uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering models and optimization techniques for emergency response facility location and planning: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the interval data robust assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust set covering problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2018.01.016 / rank
 
Normal rank

Latest revision as of 07:28, 11 December 2024

scientific article
Language Label Description Also known as
English
Formulation and algorithms for the robust maximal covering location problem
scientific article

    Statements

    Formulation and algorithms for the robust maximal covering location problem (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2018
    0 references
    robust optimization
    0 references
    min-max regret
    0 references
    uncertain data
    0 references
    heuristics
    0 references

    Identifiers