Facility location with increasing production costs

DOI10.1016/S0377-2217(02)00176-5zbMath1012.90024OpenAlexW1973120067MaRDI QIDQ1869420

Joseph Harkness, Charles S. Re Velle

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00176-5

zbMATH Keywords

integer programminglocation

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (8)

A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem ⋮ Logistics distribution centers location problem and algorithm under fuzzy environment ⋮ Benders decomposition without separability: a computational study for capacitated facility location problems ⋮ A multi-objective chance-constrained network optimal model with random fuzzy coefficients and its application to logistics distribution center location problem ⋮ A computational study of a nonlinear minsum facility location problem ⋮ Facility location models for distribution system design ⋮ Capacitated facility location problem with general setup cost ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs

Cites Work

• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• An algorithm for solving large capacitated warehouse location problems
• On the exact solution of large-scale simple plant location problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Facility siting and integer-friendly programming
• The simple plant location problem: Survey and synthesis
• A direct dual method for the mixed plant location problem with some side constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Based Procedure for Dynamic Facility Location
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Optimal Facility Location with Concave Costs
• Integer Programming: Methods, Uses, Computations
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• A branch‐bound algorithm for the capacitated facilities location problem
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

This page was built for publication: Facility location with increasing production costs