Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location

From MaRDI portal

Revision as of 22:00, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3221722

Jump to:navigation, search

DOI10.2307/2582078zbMath0557.90024OpenAlexW4240127370MaRDI QIDQ3221722

R. A. Whitaker

Publication date: 1985

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582078

zbMATH Keywords

heuristic algorithms warehouse location minimum total distribution costs network of demands

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (5)

An algorithm for solving large capacitated warehouse location problems ⋮ An integrated plant loading model with economies of scale and scope ⋮ Supply chain design considering economies of scale and transport frequencies ⋮ Heuristic methods and applications: A categorized survey ⋮ Designing distribution systems with transport economies of scale

This page was built for publication: Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3221722&oldid=16337674"