An efficient heuristic approach for a multi-period logistics network redesign problem (Q458939): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11750-011-0235-3 / rank
Normal rank
 
Property / author
 
Property / author: D. Rodríguez-Gómez / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / 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: 90C06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6352454 / rank
 
Normal rank
Property / zbMATH Keywords
 
logistics network redesign
Property / zbMATH Keywords: logistics network redesign / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristic
Property / zbMATH Keywords: heuristic / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming
Property / zbMATH Keywords: linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
rounding
Property / zbMATH Keywords: rounding / rank
 
Normal rank
Property / zbMATH Keywords
 
local search
Property / zbMATH Keywords: local search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.1007/s11750-011-0235-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036062540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution network design: New problems and related 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: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated model for logistics network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiperiod two-echelon multicommodity capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic supply chain design with inventory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location/network design problems. / 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: Facility location and supply chain management. A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic programming approach for supply chain network design under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain design under uncertainty using sample average approximation and dual decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3156770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev's approximation algorithms and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11750-011-0235-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:13, 9 December 2024

scientific article
Language Label Description Also known as
English
An efficient heuristic approach for a multi-period logistics network redesign problem
scientific article

    Statements

    An efficient heuristic approach for a multi-period logistics network redesign problem (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2014
    0 references
    logistics network redesign
    0 references
    heuristic
    0 references
    linear programming
    0 references
    rounding
    0 references
    local search
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references