Solving a dynamic facility location problem with partial closing and reopening (Q342268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2015.10.011 / 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: 90C11 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654128 / rank
 
Normal rank
Property / zbMATH Keywords
 
facility location
Property / zbMATH Keywords: facility location / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic capacity adjustment
Property / zbMATH Keywords: dynamic capacity adjustment / rank
 
Normal rank
Property / zbMATH Keywords
 
Lagrangian relaxation
Property / zbMATH Keywords: Lagrangian relaxation / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed-integer programming
Property / zbMATH Keywords: mixed-integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
industrial application
Property / zbMATH Keywords: industrial application / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2015.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1881614784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving complex multi-period location models using simulated annealing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the capacitated, multi-commodity multi-period facility location problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the dynamic facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for a modular capacitated location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated dynamic location problems with opening, closure and reopening of facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: About Lagrangian methods in integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated concentrator location problem: a reformulation by discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving a logging camp location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic algorithm for a public healthcare facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations Research and Capacity Expansion Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic facility location with general long-run costs and convex short-run costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Dynamic Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Dimensional Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiperiod Location-Allocation Problem with Relocation of Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location problem with general setup cost / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2015.10.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:11, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving a dynamic facility location problem with partial closing and reopening
scientific article

    Statements

    Solving a dynamic facility location problem with partial closing and reopening (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    facility location
    0 references
    dynamic capacity adjustment
    0 references
    Lagrangian relaxation
    0 references
    mixed-integer programming
    0 references
    industrial application
    0 references
    0 references
    0 references
    0 references

    Identifiers