Solving the plant location problem on a line by linear programming

DOI10.1007/BF02564792zbMath0916.90176OpenAlexW1978407276MaRDI QIDQ1284603

Jack Brimberg, Charles S. Re Velle

Publication date: 26 April 1999

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02564792

zbMATH Keywords

\(p\)-median problemlinear programming relaxationplant locationuncapacitated plant locationinteger friendliness

Mathematics Subject Classification ID

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

Related Items (3)

Location and sizing of facilities on a line ⋮ A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand ⋮ On the linear relaxation of the \(p\)-median problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the exact solution of large-scale simple plant location problems
• Facility siting and integer-friendly programming
• A Dual-Based Procedure for Uncapacitated Facility Location
• Integer Programming: Methods, Uses, Computations
• A branch‐bound algorithm for the capacitated facilities location problem

This page was built for publication: Solving the plant location problem on a line by linear programming