Approximate robust optimization for the connected facility location problem (Q299099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.10.011 / rank
Normal rank
 
Property / author
 
Property / author: M. Dambrine / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C47 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6596264 / rank
 
Normal rank
Property / zbMATH Keywords
 
network design
Property / zbMATH Keywords: network design / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
connected facility location problem
Property / zbMATH Keywords: connected facility location problem / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation
Property / zbMATH Keywords: approximation / 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.dam.2015.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2210829295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the robust spanning tree problem with interval data / 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: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579459 / 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: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Cut Algorithm for a Steiner Tree-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymmetric Connected Facility Location Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / 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.DAM.2015.10.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximate robust optimization for the connected facility location problem
scientific article

    Statements

    Approximate robust optimization for the connected facility location problem (English)
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    network design
    0 references
    robust optimization
    0 references
    connected facility location problem
    0 references
    heuristics
    0 references
    approximation
    0 references

    Identifiers