Linear Relaxations of the Capacitated Warehouse Location Problem

DOI10.2307/2581665MaRDI QIDQ3936463zbMATH OpenOpenAlexFDO

Authors Barrie Baker

Publication date 1982

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

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

zbMATH Keywords

lower boundinglinear relaxationscapacitated warehouse location problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(8)

• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• Approximate solutions to large scale capacitated facility location problems
• An algorithm for solving large capacitated warehouse location problems
• Lagrangean heuristics for location problems
• A comparison of heuristics and relaxations for the capacitated plant location problem
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• The capacitated plant location problem

This page was built for publication: Linear Relaxations of the Capacitated Warehouse Location Problem

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