Improved handling of uncertainty and robustness in set covering problems (Q1695010): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ejor.2017.04.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2608348709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Set Covering with Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robust Knapsacks: Γ-Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative formulation for certain fuzzy set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguous chance constrained problems and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a fuzzy set-covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem / 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 solution of the robust knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic facility location: A review / 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: Q4830009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review, extension and prediction in emergency service siting models / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP reformulations of the probabilistic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributionally Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set covering problem revisited: an empirical study of the value of dual information / rank
 
Normal rank

Latest revision as of 01:46, 15 July 2024

scientific article
Language Label Description Also known as
English
Improved handling of uncertainty and robustness in set covering problems
scientific article

    Statements

    Improved handling of uncertainty and robustness in set covering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2018
    0 references
    integer programming
    0 references
    set covering problem
    0 references
    robust optimization
    0 references
    cutting plane algorithms
    0 references
    emergency medical services
    0 references
    0 references

    Identifiers