scientific article; zbMATH DE number 1189252

MaRDI QIDQ3839019zbMATH OpenFDO

Authors Arno Bruns

Publication date 1 June 1999

zbMATH Keywords

capacitated facility locationdiscrete locationheuristic

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• An LP-based heuristic for two-stage capacitated facility location problems
• Lagrangian heuristic for the two-stage capacitated facility location problem
• scientific article; zbMATH DE number 1189254
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• scientific article; zbMATH DE number 1264401

Cited in

(10)

• An effective heuristic for large-scale capacitated facility location problems
• An effective hybrid approach to the two-stage capacitated facility location problem
• Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities
• scientific article; zbMATH DE number 6004949 (Why is no real title available?)
• An LP-based heuristic for two-stage capacitated facility location problems
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• Analysis of a Local Search Heuristic for Facility Location Problems
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• A scatter search-based heuristic to locate capacitated transshipment points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839019)