An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure

DOI10.1007/s10479-005-2036-2zbMath1114.90053OpenAlexW2085298416MaRDI QIDQ816402

Dmitry Krass, Oded Berman

Publication date: 9 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2036-2

zbMATH Keywords

integer programmingfacility location modelscover problems

Mathematics Subject Classification ID

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

Related Items (3)

A generalized model for locating facilities on a network with flow-based demand ⋮ The ordered gradual covering location problem on a network ⋮ Generalized coverage: new developments in covering location models

Cites Work

• Unnamed Item
• Unnamed Item
• A method for solving to optimality uncapacitated location problems
• Facility siting and integer-friendly programming
• The gradual covering decay location problem on a network.
• The simple plant location problem: Survey and synthesis
• A Dual-Based Procedure for Uncapacitated Facility Location
• Bounds for Row-Aggregation in Linear Programming
• A Dual-Bounded Algorithm for the p-Median Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• The generalized maximal covering location problem

This page was built for publication: An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure